/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:43:44,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:43:44,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:43:44,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:43:44,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:43:44,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:43:44,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:43:44,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:43:44,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:43:44,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:43:44,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:43:44,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:43:44,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:43:44,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:43:44,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:43:44,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:43:44,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:43:44,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:43:44,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:43:44,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:43:44,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:43:44,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:43:44,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:43:44,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:43:44,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:43:44,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:43:44,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:43:44,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:43:44,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:43:44,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:43:44,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:43:44,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:43:44,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:43:44,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:43:44,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:43:44,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:43:44,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:43:44,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:43:44,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:43:44,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:43:44,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:43:44,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:43:44,905 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:43:44,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:43:44,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:43:44,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:43:44,907 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:43:44,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:43:44,907 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:43:44,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:43:44,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:43:44,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:43:44,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:43:44,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:43:44,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:43:44,909 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:43:44,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:43:44,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:43:44,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:43:44,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:43:44,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:43:44,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:43:44,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:43:44,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:44,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:43:44,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:43:44,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:43:44,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:43:44,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:43:44,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:43:44,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:43:44,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:43:45,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:43:45,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:43:45,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:43:45,269 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:43:45,270 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:43:45,271 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl [2020-02-10 19:43:45,271 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl' [2020-02-10 19:43:45,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:43:45,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:43:45,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:45,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:43:45,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:43:45,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:45,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:43:45,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:43:45,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:43:45,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... [2020-02-10 19:43:45,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:43:45,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:43:45,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:43:45,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:43:45,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:45,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:43:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:43:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:43:45,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:43:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:43:45,469 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:43:45,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:43:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:43:45,470 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:43:45,470 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:43:45,470 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:43:45,470 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:43:45,470 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:43:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:43:45,471 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:43:45,471 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:43:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:43:45,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:43:45,471 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:43:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:43:45,472 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:43:45,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:43:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:43:45,473 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:43:45,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 19:43:45,480 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 19:43:45,481 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 19:43:45,483 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 19:43:45,753 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:43:45,753 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:43:45,769 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:45 BoogieIcfgContainer [2020-02-10 19:43:45,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:43:45,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:43:45,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:43:45,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:43:45,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:45" (1/2) ... [2020-02-10 19:43:45,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d76611 and model type example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:43:45, skipping insertion in model container [2020-02-10 19:43:45,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:45" (2/2) ... [2020-02-10 19:43:45,788 INFO L109 eAbstractionObserver]: Analyzing ICFG example_8.bpl [2020-02-10 19:43:45,801 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:43:45,801 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:43:45,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:43:45,819 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:43:46,044 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-02-10 19:43:46,062 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:43:46,062 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:43:46,063 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:43:46,063 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:43:46,063 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:43:46,063 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:43:46,063 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:43:46,064 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:43:46,079 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 99 transitions [2020-02-10 19:43:46,080 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-02-10 19:43:46,479 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-02-10 19:43:46,479 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-02-10 19:43:46,498 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-02-10 19:43:46,523 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-02-10 19:43:46,771 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-02-10 19:43:46,771 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-02-10 19:43:46,781 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-02-10 19:43:46,804 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1904 [2020-02-10 19:43:46,805 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:43:46,971 INFO L206 etLargeBlockEncoding]: Checked pairs total: 532 [2020-02-10 19:43:46,971 INFO L214 etLargeBlockEncoding]: Total number of compositions: 9 [2020-02-10 19:43:46,975 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 90 transitions [2020-02-10 19:43:47,932 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6818 states. [2020-02-10 19:43:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states. [2020-02-10 19:43:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:47,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:47,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] [2020-02-10 19:43:47,992 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1176015965, now seen corresponding path program 1 times [2020-02-10 19:43:48,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:48,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201252881] [2020-02-10 19:43:48,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:48,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201252881] [2020-02-10 19:43:48,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:48,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:48,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503085282] [2020-02-10 19:43:48,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:48,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:48,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:48,275 INFO L87 Difference]: Start difference. First operand 6818 states. Second operand 3 states. [2020-02-10 19:43:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:48,413 INFO L93 Difference]: Finished difference Result 6690 states and 34994 transitions. [2020-02-10 19:43:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:48,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:48,521 INFO L225 Difference]: With dead ends: 6690 [2020-02-10 19:43:48,521 INFO L226 Difference]: Without dead ends: 6689 [2020-02-10 19:43:48,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2020-02-10 19:43:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2020-02-10 19:43:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2020-02-10 19:43:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 34993 transitions. [2020-02-10 19:43:49,414 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 34993 transitions. Word has length 25 [2020-02-10 19:43:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,416 INFO L479 AbstractCegarLoop]: Abstraction has 6689 states and 34993 transitions. [2020-02-10 19:43:49,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 34993 transitions. [2020-02-10 19:43:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:49,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,447 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1467806563, now seen corresponding path program 1 times [2020-02-10 19:43:49,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219890099] [2020-02-10 19:43:49,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:49,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219890099] [2020-02-10 19:43:49,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:49,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:49,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792173087] [2020-02-10 19:43:49,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:49,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:49,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:49,522 INFO L87 Difference]: Start difference. First operand 6689 states and 34993 transitions. Second operand 3 states. [2020-02-10 19:43:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:49,622 INFO L93 Difference]: Finished difference Result 4881 states and 24065 transitions. [2020-02-10 19:43:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:49,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:49,687 INFO L225 Difference]: With dead ends: 4881 [2020-02-10 19:43:49,688 INFO L226 Difference]: Without dead ends: 4881 [2020-02-10 19:43:49,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2020-02-10 19:43:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2020-02-10 19:43:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2020-02-10 19:43:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 24065 transitions. [2020-02-10 19:43:49,926 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 24065 transitions. Word has length 25 [2020-02-10 19:43:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:49,926 INFO L479 AbstractCegarLoop]: Abstraction has 4881 states and 24065 transitions. [2020-02-10 19:43:49,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 24065 transitions. [2020-02-10 19:43:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:49,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:49,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:49,947 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash -795426887, now seen corresponding path program 1 times [2020-02-10 19:43:49,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:49,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130486334] [2020-02-10 19:43:49,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:50,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130486334] [2020-02-10 19:43:50,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:50,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768936544] [2020-02-10 19:43:50,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:50,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:50,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,009 INFO L87 Difference]: Start difference. First operand 4881 states and 24065 transitions. Second operand 3 states. [2020-02-10 19:43:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,070 INFO L93 Difference]: Finished difference Result 3205 states and 15221 transitions. [2020-02-10 19:43:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:50,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,089 INFO L225 Difference]: With dead ends: 3205 [2020-02-10 19:43:50,090 INFO L226 Difference]: Without dead ends: 3205 [2020-02-10 19:43:50,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2020-02-10 19:43:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3205. [2020-02-10 19:43:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2020-02-10 19:43:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 15221 transitions. [2020-02-10 19:43:50,344 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 15221 transitions. Word has length 25 [2020-02-10 19:43:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,345 INFO L479 AbstractCegarLoop]: Abstraction has 3205 states and 15221 transitions. [2020-02-10 19:43:50,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 15221 transitions. [2020-02-10 19:43:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:50,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,358 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash 694354523, now seen corresponding path program 1 times [2020-02-10 19:43:50,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470060183] [2020-02-10 19:43:50,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:50,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470060183] [2020-02-10 19:43:50,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:50,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569784188] [2020-02-10 19:43:50,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:50,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:50,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,429 INFO L87 Difference]: Start difference. First operand 3205 states and 15221 transitions. Second operand 3 states. [2020-02-10 19:43:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,469 INFO L93 Difference]: Finished difference Result 2757 states and 12469 transitions. [2020-02-10 19:43:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:50,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,483 INFO L225 Difference]: With dead ends: 2757 [2020-02-10 19:43:50,483 INFO L226 Difference]: Without dead ends: 2757 [2020-02-10 19:43:50,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2020-02-10 19:43:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2020-02-10 19:43:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2020-02-10 19:43:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 12469 transitions. [2020-02-10 19:43:50,604 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 12469 transitions. Word has length 25 [2020-02-10 19:43:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,605 INFO L479 AbstractCegarLoop]: Abstraction has 2757 states and 12469 transitions. [2020-02-10 19:43:50,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 12469 transitions. [2020-02-10 19:43:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:50,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,615 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:50,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1749585931, now seen corresponding path program 1 times [2020-02-10 19:43:50,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154708638] [2020-02-10 19:43:50,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:50,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154708638] [2020-02-10 19:43:50,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:50,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364945363] [2020-02-10 19:43:50,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:50,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,645 INFO L87 Difference]: Start difference. First operand 2757 states and 12469 transitions. Second operand 3 states. [2020-02-10 19:43:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,675 INFO L93 Difference]: Finished difference Result 1773 states and 7633 transitions. [2020-02-10 19:43:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:50,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,686 INFO L225 Difference]: With dead ends: 1773 [2020-02-10 19:43:50,686 INFO L226 Difference]: Without dead ends: 1773 [2020-02-10 19:43:50,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-02-10 19:43:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2020-02-10 19:43:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2020-02-10 19:43:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 7633 transitions. [2020-02-10 19:43:50,770 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 7633 transitions. Word has length 25 [2020-02-10 19:43:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,770 INFO L479 AbstractCegarLoop]: Abstraction has 1773 states and 7633 transitions. [2020-02-10 19:43:50,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 7633 transitions. [2020-02-10 19:43:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:50,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,777 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,777 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1906045009, now seen corresponding path program 1 times [2020-02-10 19:43:50,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393725829] [2020-02-10 19:43:50,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,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 19:43:50,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393725829] [2020-02-10 19:43:50,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:50,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37835498] [2020-02-10 19:43:50,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:50,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,836 INFO L87 Difference]: Start difference. First operand 1773 states and 7633 transitions. Second operand 3 states. [2020-02-10 19:43:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,859 INFO L93 Difference]: Finished difference Result 1119 states and 4673 transitions. [2020-02-10 19:43:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:50,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,865 INFO L225 Difference]: With dead ends: 1119 [2020-02-10 19:43:50,867 INFO L226 Difference]: Without dead ends: 1119 [2020-02-10 19:43:50,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2020-02-10 19:43:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2020-02-10 19:43:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-02-10 19:43:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 4673 transitions. [2020-02-10 19:43:50,927 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 4673 transitions. Word has length 25 [2020-02-10 19:43:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:50,927 INFO L479 AbstractCegarLoop]: Abstraction has 1119 states and 4673 transitions. [2020-02-10 19:43:50,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 4673 transitions. [2020-02-10 19:43:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:50,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:50,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:50,934 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash -389208845, now seen corresponding path program 1 times [2020-02-10 19:43:50,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:50,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477388688] [2020-02-10 19:43:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:50,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477388688] [2020-02-10 19:43:50,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:50,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:50,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40730286] [2020-02-10 19:43:50,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:50,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:50,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:50,982 INFO L87 Difference]: Start difference. First operand 1119 states and 4673 transitions. Second operand 3 states. [2020-02-10 19:43:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:50,994 INFO L93 Difference]: Finished difference Result 767 states and 3073 transitions. [2020-02-10 19:43:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:50,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 19:43:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:50,998 INFO L225 Difference]: With dead ends: 767 [2020-02-10 19:43:50,998 INFO L226 Difference]: Without dead ends: 767 [2020-02-10 19:43:50,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-02-10 19:43:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2020-02-10 19:43:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-02-10 19:43:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3073 transitions. [2020-02-10 19:43:51,103 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3073 transitions. Word has length 25 [2020-02-10 19:43:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,104 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 3073 transitions. [2020-02-10 19:43:51,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3073 transitions. [2020-02-10 19:43:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:51,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,107 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -377910571, now seen corresponding path program 1 times [2020-02-10 19:43:51,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127652001] [2020-02-10 19:43:51,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:51,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127652001] [2020-02-10 19:43:51,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:51,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:51,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066273238] [2020-02-10 19:43:51,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:51,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:51,705 INFO L87 Difference]: Start difference. First operand 767 states and 3073 transitions. Second operand 10 states. [2020-02-10 19:43:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:51,901 INFO L93 Difference]: Finished difference Result 1367 states and 4850 transitions. [2020-02-10 19:43:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:51,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:51,907 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 19:43:51,907 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 19:43:51,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 19:43:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-02-10 19:43:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:43:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-02-10 19:43:51,965 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-02-10 19:43:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:51,966 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-02-10 19:43:51,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-02-10 19:43:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:51,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:51,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:51,969 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 592341043, now seen corresponding path program 2 times [2020-02-10 19:43:51,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:51,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061126448] [2020-02-10 19:43:51,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:52,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061126448] [2020-02-10 19:43:52,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:52,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:52,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745265809] [2020-02-10 19:43:52,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:52,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:52,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:52,487 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:43:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:52,643 INFO L93 Difference]: Finished difference Result 1369 states and 4850 transitions. [2020-02-10 19:43:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:52,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:52,649 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 19:43:52,649 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:43:52,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:43:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 19:43:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:43:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3153 transitions. [2020-02-10 19:43:52,694 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3153 transitions. Word has length 25 [2020-02-10 19:43:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:52,694 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3153 transitions. [2020-02-10 19:43:52,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3153 transitions. [2020-02-10 19:43:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:52,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:52,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:52,698 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1548123507, now seen corresponding path program 3 times [2020-02-10 19:43:52,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:52,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018146488] [2020-02-10 19:43:52,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:53,080 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-02-10 19:43:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:53,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018146488] [2020-02-10 19:43:53,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:53,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:53,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114074913] [2020-02-10 19:43:53,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:53,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:53,414 INFO L87 Difference]: Start difference. First operand 785 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:43:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:53,594 INFO L93 Difference]: Finished difference Result 1363 states and 4838 transitions. [2020-02-10 19:43:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:53,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:53,601 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 19:43:53,602 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:43:53,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:43:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-02-10 19:43:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:43:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3158 transitions. [2020-02-10 19:43:53,645 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3158 transitions. Word has length 25 [2020-02-10 19:43:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:53,646 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3158 transitions. [2020-02-10 19:43:53,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3158 transitions. [2020-02-10 19:43:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:53,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:53,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:53,650 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1766089071, now seen corresponding path program 4 times [2020-02-10 19:43:53,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:53,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584516822] [2020-02-10 19:43:53,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,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 19:43:54,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584516822] [2020-02-10 19:43:54,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:54,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222773551] [2020-02-10 19:43:54,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:54,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:54,156 INFO L87 Difference]: Start difference. First operand 788 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:43:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,355 INFO L93 Difference]: Finished difference Result 1362 states and 4833 transitions. [2020-02-10 19:43:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:54,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,362 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 19:43:54,362 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 19:43:54,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 19:43:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-02-10 19:43:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:43:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-02-10 19:43:54,407 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-02-10 19:43:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:54,408 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-02-10 19:43:54,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-02-10 19:43:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:54,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:54,411 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 930966229, now seen corresponding path program 5 times [2020-02-10 19:43:54,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586613308] [2020-02-10 19:43:54,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:54,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586613308] [2020-02-10 19:43:54,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:54,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501127245] [2020-02-10 19:43:54,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:54,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:54,831 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:43:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:54,987 INFO L93 Difference]: Finished difference Result 1367 states and 4843 transitions. [2020-02-10 19:43:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:54,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:54,993 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 19:43:54,993 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 19:43:54,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 19:43:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 19:43:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:43:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 19:43:55,037 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 19:43:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,037 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 19:43:55,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 19:43:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:55,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,040 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1753060109, now seen corresponding path program 6 times [2020-02-10 19:43:55,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850226090] [2020-02-10 19:43:55,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:55,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 19:43:55,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850226090] [2020-02-10 19:43:55,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:55,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:55,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868287024] [2020-02-10 19:43:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:55,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:55,529 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:43:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,706 INFO L93 Difference]: Finished difference Result 1364 states and 4834 transitions. [2020-02-10 19:43:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:55,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,711 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:43:55,711 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 19:43:55,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 19:43:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-02-10 19:43:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:43:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3142 transitions. [2020-02-10 19:43:55,757 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3142 transitions. Word has length 25 [2020-02-10 19:43:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:55,758 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3142 transitions. [2020-02-10 19:43:55,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3142 transitions. [2020-02-10 19:43:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:55,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:55,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:55,760 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash -800396297, now seen corresponding path program 7 times [2020-02-10 19:43:55,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:55,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514450213] [2020-02-10 19:43:55,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:56,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514450213] [2020-02-10 19:43:56,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:56,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323109007] [2020-02-10 19:43:56,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:56,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:56,208 INFO L87 Difference]: Start difference. First operand 782 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:43:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:56,428 INFO L93 Difference]: Finished difference Result 1376 states and 4871 transitions. [2020-02-10 19:43:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:56,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:56,433 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:43:56,434 INFO L226 Difference]: Without dead ends: 1363 [2020-02-10 19:43:56,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-02-10 19:43:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 790. [2020-02-10 19:43:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:43:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3164 transitions. [2020-02-10 19:43:56,481 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3164 transitions. Word has length 25 [2020-02-10 19:43:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:56,482 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3164 transitions. [2020-02-10 19:43:56,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3164 transitions. [2020-02-10 19:43:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:56,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:56,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:56,485 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 169855317, now seen corresponding path program 8 times [2020-02-10 19:43:56,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:56,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133720205] [2020-02-10 19:43:56,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:56,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133720205] [2020-02-10 19:43:56,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:56,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:56,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883675693] [2020-02-10 19:43:56,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:56,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:56,903 INFO L87 Difference]: Start difference. First operand 790 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:43:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,061 INFO L93 Difference]: Finished difference Result 1378 states and 4871 transitions. [2020-02-10 19:43:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:57,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,065 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 19:43:57,065 INFO L226 Difference]: Without dead ends: 1359 [2020-02-10 19:43:57,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-02-10 19:43:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 786. [2020-02-10 19:43:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:43:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3153 transitions. [2020-02-10 19:43:57,109 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3153 transitions. Word has length 25 [2020-02-10 19:43:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,109 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3153 transitions. [2020-02-10 19:43:57,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3153 transitions. [2020-02-10 19:43:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:57,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,112 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1243295437, now seen corresponding path program 9 times [2020-02-10 19:43:57,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661858585] [2020-02-10 19:43:57,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:57,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661858585] [2020-02-10 19:43:57,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:57,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:57,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503598717] [2020-02-10 19:43:57,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:57,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:57,534 INFO L87 Difference]: Start difference. First operand 786 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:43:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:57,704 INFO L93 Difference]: Finished difference Result 1377 states and 4869 transitions. [2020-02-10 19:43:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:57,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:57,708 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 19:43:57,709 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:43:57,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:43:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-02-10 19:43:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:43:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3160 transitions. [2020-02-10 19:43:57,752 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3160 transitions. Word has length 25 [2020-02-10 19:43:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,752 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3160 transitions. [2020-02-10 19:43:57,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3160 transitions. [2020-02-10 19:43:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:57,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:57,755 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash -252037615, now seen corresponding path program 10 times [2020-02-10 19:43:57,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51893695] [2020-02-10 19:43:57,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:58,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51893695] [2020-02-10 19:43:58,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:58,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687287940] [2020-02-10 19:43:58,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:58,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:58,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:58,178 INFO L87 Difference]: Start difference. First operand 790 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:43:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,341 INFO L93 Difference]: Finished difference Result 1380 states and 4871 transitions. [2020-02-10 19:43:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:58,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,346 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 19:43:58,346 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 19:43:58,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 19:43:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-02-10 19:43:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:43:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-02-10 19:43:58,380 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-02-10 19:43:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:58,380 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-02-10 19:43:58,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-02-10 19:43:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:58,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:58,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:58,383 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash 834076727, now seen corresponding path program 11 times [2020-02-10 19:43:58,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:58,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628329080] [2020-02-10 19:43:58,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:58,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628329080] [2020-02-10 19:43:58,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:58,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516073907] [2020-02-10 19:43:58,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:58,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:58,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:58,810 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:43:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,980 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-02-10 19:43:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:58,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,984 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 19:43:58,985 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:43:58,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:43:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 792. [2020-02-10 19:43:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:43:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3160 transitions. [2020-02-10 19:43:59,031 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3160 transitions. Word has length 25 [2020-02-10 19:43:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,031 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3160 transitions. [2020-02-10 19:43:59,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3160 transitions. [2020-02-10 19:43:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:59,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:59,035 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash -239008653, now seen corresponding path program 12 times [2020-02-10 19:43:59,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661044765] [2020-02-10 19:43:59,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:59,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661044765] [2020-02-10 19:43:59,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:59,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:43:59,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239877201] [2020-02-10 19:43:59,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:43:59,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:43:59,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:43:59,474 INFO L87 Difference]: Start difference. First operand 792 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:43:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:59,602 INFO L93 Difference]: Finished difference Result 1384 states and 4875 transitions. [2020-02-10 19:43:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:43:59,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:43:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:59,605 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 19:43:59,605 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:43:59,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:43:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:43:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 782. [2020-02-10 19:43:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:43:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-02-10 19:43:59,635 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-02-10 19:43:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:59,636 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-02-10 19:43:59,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:43:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-02-10 19:43:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:43:59,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:59,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] [2020-02-10 19:43:59,638 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash 703152055, now seen corresponding path program 13 times [2020-02-10 19:43:59,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:59,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279503436] [2020-02-10 19:43:59,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:00,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279503436] [2020-02-10 19:44:00,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:00,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706251638] [2020-02-10 19:44:00,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:00,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:00,043 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:44:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,184 INFO L93 Difference]: Finished difference Result 1364 states and 4837 transitions. [2020-02-10 19:44:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:00,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,188 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:00,188 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 19:44:00,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 19:44:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-02-10 19:44:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 19:44:00,220 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 19:44:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,221 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 19:44:00,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 19:44:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:00,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,224 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1683906773, now seen corresponding path program 14 times [2020-02-10 19:44:00,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832258081] [2020-02-10 19:44:00,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:00,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832258081] [2020-02-10 19:44:00,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:00,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059717219] [2020-02-10 19:44:00,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:00,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:00,712 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:44:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,931 INFO L93 Difference]: Finished difference Result 1363 states and 4832 transitions. [2020-02-10 19:44:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:00,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,937 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 19:44:00,937 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 19:44:00,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 19:44:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-02-10 19:44:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-02-10 19:44:00,965 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-02-10 19:44:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,966 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-02-10 19:44:00,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-02-10 19:44:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:00,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:00,969 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1665781163, now seen corresponding path program 15 times [2020-02-10 19:44:00,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858955397] [2020-02-10 19:44:00,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:01,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858955397] [2020-02-10 19:44:01,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:01,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685350987] [2020-02-10 19:44:01,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:01,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:01,396 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:44:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,551 INFO L93 Difference]: Finished difference Result 1369 states and 4845 transitions. [2020-02-10 19:44:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:01,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,554 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 19:44:01,554 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 19:44:01,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 19:44:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 789. [2020-02-10 19:44:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:44:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 19:44:01,589 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 19:44:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,589 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 19:44:01,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 19:44:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:01,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,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] [2020-02-10 19:44:01,591 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash -674523341, now seen corresponding path program 16 times [2020-02-10 19:44:01,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169338034] [2020-02-10 19:44:01,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,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 19:44:01,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169338034] [2020-02-10 19:44:01,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:01,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819914282] [2020-02-10 19:44:01,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:01,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:01,993 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:44:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,163 INFO L93 Difference]: Finished difference Result 1372 states and 4847 transitions. [2020-02-10 19:44:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:02,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,168 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:44:02,168 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 19:44:02,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 19:44:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 785. [2020-02-10 19:44:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 19:44:02,195 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 19:44:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,196 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 19:44:02,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 19:44:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:02,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,198 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1946839113, now seen corresponding path program 17 times [2020-02-10 19:44:02,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871762143] [2020-02-10 19:44:02,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:02,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871762143] [2020-02-10 19:44:02,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:02,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547008722] [2020-02-10 19:44:02,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:02,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:02,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:02,622 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:44:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,770 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-02-10 19:44:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:02,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,774 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 19:44:02,775 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 19:44:02,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 19:44:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-02-10 19:44:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 19:44:02,803 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 19:44:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,803 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 19:44:02,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 19:44:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:02,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,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] [2020-02-10 19:44:02,806 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash -335898155, now seen corresponding path program 18 times [2020-02-10 19:44:02,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071682456] [2020-02-10 19:44:02,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:03,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071682456] [2020-02-10 19:44:03,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:03,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134486204] [2020-02-10 19:44:03,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:03,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:03,206 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:44:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,344 INFO L93 Difference]: Finished difference Result 1370 states and 4840 transitions. [2020-02-10 19:44:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:03,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,348 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:03,348 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 19:44:03,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 19:44:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 782. [2020-02-10 19:44:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-02-10 19:44:03,379 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-02-10 19:44:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,379 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-02-10 19:44:03,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-02-10 19:44:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:03,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,381 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash 46993459, now seen corresponding path program 19 times [2020-02-10 19:44:03,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017237] [2020-02-10 19:44:03,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,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 19:44:03,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017237] [2020-02-10 19:44:03,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:03,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066334508] [2020-02-10 19:44:03,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:03,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:03,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:03,788 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:44:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,935 INFO L93 Difference]: Finished difference Result 1372 states and 4852 transitions. [2020-02-10 19:44:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:03,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,939 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:44:03,939 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 19:44:03,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 19:44:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-02-10 19:44:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 19:44:03,967 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,968 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 19:44:03,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 19:44:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:03,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:03,969 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1657934417, now seen corresponding path program 20 times [2020-02-10 19:44:03,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565440075] [2020-02-10 19:44:03,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,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 19:44:04,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565440075] [2020-02-10 19:44:04,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:04,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185156886] [2020-02-10 19:44:04,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:04,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:04,390 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,533 INFO L93 Difference]: Finished difference Result 1369 states and 4843 transitions. [2020-02-10 19:44:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:04,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,537 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 19:44:04,538 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 19:44:04,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 19:44:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 785. [2020-02-10 19:44:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 19:44:04,563 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 19:44:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,563 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 19:44:04,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 19:44:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:04,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,565 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1553444395, now seen corresponding path program 21 times [2020-02-10 19:44:04,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587870410] [2020-02-10 19:44:04,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,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 19:44:04,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587870410] [2020-02-10 19:44:04,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:04,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283091546] [2020-02-10 19:44:04,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:04,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:04,955 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:44:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,079 INFO L93 Difference]: Finished difference Result 1379 states and 4866 transitions. [2020-02-10 19:44:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:05,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,083 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 19:44:05,083 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:44:05,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:44:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 791. [2020-02-10 19:44:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 19:44:05,110 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 19:44:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,110 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 19:44:05,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 19:44:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:05,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,112 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1668437521, now seen corresponding path program 22 times [2020-02-10 19:44:05,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431796999] [2020-02-10 19:44:05,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,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 19:44:05,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431796999] [2020-02-10 19:44:05,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:05,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075673027] [2020-02-10 19:44:05,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:05,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:05,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:05,528 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:44:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,683 INFO L93 Difference]: Finished difference Result 1380 states and 4862 transitions. [2020-02-10 19:44:05,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:05,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,688 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 19:44:05,688 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:44:05,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:44:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-02-10 19:44:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 19:44:05,724 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,725 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 19:44:05,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 19:44:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:05,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:05,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:05,727 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:05,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1542941291, now seen corresponding path program 23 times [2020-02-10 19:44:05,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:05,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046189832] [2020-02-10 19:44:05,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,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 19:44:06,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046189832] [2020-02-10 19:44:06,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:06,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983001489] [2020-02-10 19:44:06,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:06,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:06,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:06,180 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,322 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 19:44:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:06,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,325 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:06,325 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:44:06,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:44:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 19:44:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 19:44:06,355 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,355 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 19:44:06,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 19:44:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:06,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,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] [2020-02-10 19:44:06,358 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash 67999667, now seen corresponding path program 24 times [2020-02-10 19:44:06,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310675739] [2020-02-10 19:44:06,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:06,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310675739] [2020-02-10 19:44:06,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:06,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284931492] [2020-02-10 19:44:06,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:06,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:06,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:06,823 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,963 INFO L93 Difference]: Finished difference Result 1374 states and 4847 transitions. [2020-02-10 19:44:06,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:06,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,967 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 19:44:06,967 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 19:44:06,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 19:44:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 779. [2020-02-10 19:44:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:44:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3128 transitions. [2020-02-10 19:44:06,992 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3128 transitions. Word has length 25 [2020-02-10 19:44:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:06,992 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3128 transitions. [2020-02-10 19:44:06,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3128 transitions. [2020-02-10 19:44:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:06,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,995 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,995 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash -590066189, now seen corresponding path program 25 times [2020-02-10 19:44:06,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040756764] [2020-02-10 19:44:06,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:07,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040756764] [2020-02-10 19:44:07,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:07,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318946267] [2020-02-10 19:44:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:07,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:07,404 INFO L87 Difference]: Start difference. First operand 779 states and 3128 transitions. Second operand 10 states. [2020-02-10 19:44:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,571 INFO L93 Difference]: Finished difference Result 1364 states and 4840 transitions. [2020-02-10 19:44:07,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:07,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,575 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:07,575 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 19:44:07,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 19:44:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 789. [2020-02-10 19:44:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:44:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-02-10 19:44:07,605 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-02-10 19:44:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,605 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-02-10 19:44:07,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-02-10 19:44:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:07,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,608 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash 380185425, now seen corresponding path program 26 times [2020-02-10 19:44:07,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90907590] [2020-02-10 19:44:07,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,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 19:44:08,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90907590] [2020-02-10 19:44:08,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:08,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36630073] [2020-02-10 19:44:08,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:08,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:08,004 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:44:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,150 INFO L93 Difference]: Finished difference Result 1366 states and 4840 transitions. [2020-02-10 19:44:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:08,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,154 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 19:44:08,154 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 19:44:08,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 19:44:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-02-10 19:44:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-02-10 19:44:08,179 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-02-10 19:44:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,179 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-02-10 19:44:08,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-02-10 19:44:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:08,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:08,181 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1335967889, now seen corresponding path program 27 times [2020-02-10 19:44:08,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792637875] [2020-02-10 19:44:08,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,616 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 19:44:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792637875] [2020-02-10 19:44:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471698870] [2020-02-10 19:44:08,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:08,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:08,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:08,624 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:44:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,774 INFO L93 Difference]: Finished difference Result 1360 states and 4828 transitions. [2020-02-10 19:44:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:08,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,778 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 19:44:08,778 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 19:44:08,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 19:44:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 19:44:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 19:44:08,801 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 19:44:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,801 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 19:44:08,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 19:44:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:08,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,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] [2020-02-10 19:44:08,803 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1978244689, now seen corresponding path program 28 times [2020-02-10 19:44:08,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941760845] [2020-02-10 19:44:08,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:09,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941760845] [2020-02-10 19:44:09,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:09,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801591909] [2020-02-10 19:44:09,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:09,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:09,231 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:44:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,383 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-02-10 19:44:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:09,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,387 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 19:44:09,388 INFO L226 Difference]: Without dead ends: 1344 [2020-02-10 19:44:09,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-02-10 19:44:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-02-10 19:44:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-02-10 19:44:09,419 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-02-10 19:44:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,420 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-02-10 19:44:09,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-02-10 19:44:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:09,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,422 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash 718810611, now seen corresponding path program 29 times [2020-02-10 19:44:09,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215468528] [2020-02-10 19:44:09,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,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 19:44:09,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215468528] [2020-02-10 19:44:09,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:09,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94744331] [2020-02-10 19:44:09,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:09,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:09,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:09,845 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:44:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,986 INFO L93 Difference]: Finished difference Result 1364 states and 4833 transitions. [2020-02-10 19:44:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:09,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,990 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:09,991 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 19:44:09,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 19:44:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-02-10 19:44:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 19:44:10,017 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,017 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 19:44:10,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 19:44:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:10,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,019 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1965215727, now seen corresponding path program 30 times [2020-02-10 19:44:10,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130203985] [2020-02-10 19:44:10,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:10,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130203985] [2020-02-10 19:44:10,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:10,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320723261] [2020-02-10 19:44:10,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:10,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:10,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:10,438 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,597 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-02-10 19:44:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:10,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,601 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 19:44:10,601 INFO L226 Difference]: Without dead ends: 1343 [2020-02-10 19:44:10,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-02-10 19:44:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 782. [2020-02-10 19:44:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-02-10 19:44:10,625 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-02-10 19:44:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,626 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-02-10 19:44:10,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-02-10 19:44:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:10,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,627 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1435037641, now seen corresponding path program 31 times [2020-02-10 19:44:10,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465911912] [2020-02-10 19:44:10,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:11,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465911912] [2020-02-10 19:44:11,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:11,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621267611] [2020-02-10 19:44:11,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:11,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:11,148 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:44:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,335 INFO L93 Difference]: Finished difference Result 1370 states and 4854 transitions. [2020-02-10 19:44:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:11,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,341 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:11,341 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 19:44:11,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 19:44:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 790. [2020-02-10 19:44:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3161 transitions. [2020-02-10 19:44:11,389 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3161 transitions. Word has length 25 [2020-02-10 19:44:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,390 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3161 transitions. [2020-02-10 19:44:11,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3161 transitions. [2020-02-10 19:44:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:11,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:11,392 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -464786027, now seen corresponding path program 32 times [2020-02-10 19:44:11,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860898151] [2020-02-10 19:44:11,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:11,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860898151] [2020-02-10 19:44:11,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:11,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720188374] [2020-02-10 19:44:11,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:11,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:11,777 INFO L87 Difference]: Start difference. First operand 790 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:44:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,929 INFO L93 Difference]: Finished difference Result 1372 states and 4854 transitions. [2020-02-10 19:44:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:11,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,932 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:44:11,932 INFO L226 Difference]: Without dead ends: 1353 [2020-02-10 19:44:11,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-02-10 19:44:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 786. [2020-02-10 19:44:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:44:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3150 transitions. [2020-02-10 19:44:11,957 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3150 transitions. Word has length 25 [2020-02-10 19:44:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,957 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3150 transitions. [2020-02-10 19:44:11,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3150 transitions. [2020-02-10 19:44:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:11,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:11,959 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash 48097297, now seen corresponding path program 33 times [2020-02-10 19:44:11,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002076754] [2020-02-10 19:44:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:12,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002076754] [2020-02-10 19:44:12,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:12,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972880513] [2020-02-10 19:44:12,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:12,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:12,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:12,423 INFO L87 Difference]: Start difference. First operand 786 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:44:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,562 INFO L93 Difference]: Finished difference Result 1369 states and 4848 transitions. [2020-02-10 19:44:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:12,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,565 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 19:44:12,566 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 19:44:12,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 19:44:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 790. [2020-02-10 19:44:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3157 transitions. [2020-02-10 19:44:12,600 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3157 transitions. Word has length 25 [2020-02-10 19:44:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,600 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3157 transitions. [2020-02-10 19:44:12,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3157 transitions. [2020-02-10 19:44:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:12,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:12,603 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1049858223, now seen corresponding path program 34 times [2020-02-10 19:44:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134472221] [2020-02-10 19:44:12,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:13,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134472221] [2020-02-10 19:44:13,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:13,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816948681] [2020-02-10 19:44:13,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:13,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:13,050 INFO L87 Difference]: Start difference. First operand 790 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:44:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,189 INFO L93 Difference]: Finished difference Result 1370 states and 4846 transitions. [2020-02-10 19:44:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:13,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,193 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:13,193 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 19:44:13,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 19:44:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 786. [2020-02-10 19:44:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:44:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-02-10 19:44:13,217 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,217 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-02-10 19:44:13,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-02-10 19:44:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:13,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:13,219 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 525031607, now seen corresponding path program 35 times [2020-02-10 19:44:13,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564210208] [2020-02-10 19:44:13,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,709 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-02-10 19:44:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:13,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564210208] [2020-02-10 19:44:13,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:13,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870179246] [2020-02-10 19:44:13,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:13,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:13,716 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,909 INFO L93 Difference]: Finished difference Result 1374 states and 4855 transitions. [2020-02-10 19:44:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:13,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,915 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 19:44:13,915 INFO L226 Difference]: Without dead ends: 1359 [2020-02-10 19:44:13,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-02-10 19:44:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 791. [2020-02-10 19:44:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 19:44:13,967 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 19:44:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,968 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 19:44:13,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 19:44:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:13,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:13,971 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1062887185, now seen corresponding path program 36 times [2020-02-10 19:44:13,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758891950] [2020-02-10 19:44:13,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,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 19:44:14,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758891950] [2020-02-10 19:44:14,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:14,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760228165] [2020-02-10 19:44:14,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:14,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:14,375 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:44:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,510 INFO L93 Difference]: Finished difference Result 1373 states and 4848 transitions. [2020-02-10 19:44:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:14,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,513 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 19:44:14,513 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:44:14,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:44:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 782. [2020-02-10 19:44:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-02-10 19:44:14,545 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-02-10 19:44:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,545 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-02-10 19:44:14,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-02-10 19:44:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:14,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:14,548 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,548 INFO L82 PathProgramCache]: Analyzing trace with hash 68510711, now seen corresponding path program 37 times [2020-02-10 19:44:14,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224646207] [2020-02-10 19:44:14,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,052 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-02-10 19:44:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:15,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224646207] [2020-02-10 19:44:15,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:15,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474457257] [2020-02-10 19:44:15,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:15,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:15,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:15,069 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:44:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,230 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-02-10 19:44:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:15,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,233 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 19:44:15,234 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 19:44:15,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 19:44:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 788. [2020-02-10 19:44:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 19:44:15,270 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,272 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 19:44:15,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 19:44:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:15,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:15,279 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1049265429, now seen corresponding path program 38 times [2020-02-10 19:44:15,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990538952] [2020-02-10 19:44:15,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:15,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990538952] [2020-02-10 19:44:15,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:15,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877756579] [2020-02-10 19:44:15,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:15,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:15,679 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,825 INFO L93 Difference]: Finished difference Result 1358 states and 4818 transitions. [2020-02-10 19:44:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:15,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,828 INFO L225 Difference]: With dead ends: 1358 [2020-02-10 19:44:15,828 INFO L226 Difference]: Without dead ends: 1343 [2020-02-10 19:44:15,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-02-10 19:44:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 785. [2020-02-10 19:44:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 19:44:15,851 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 19:44:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,851 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 19:44:15,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 19:44:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:15,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:15,853 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -374388429, now seen corresponding path program 39 times [2020-02-10 19:44:15,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220475184] [2020-02-10 19:44:15,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:16,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220475184] [2020-02-10 19:44:16,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:16,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771488823] [2020-02-10 19:44:16,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:16,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:16,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:16,255 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:44:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,418 INFO L93 Difference]: Finished difference Result 1362 states and 4827 transitions. [2020-02-10 19:44:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:16,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,422 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 19:44:16,422 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 19:44:16,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 19:44:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 789. [2020-02-10 19:44:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:44:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 19:44:16,447 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 19:44:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,448 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 19:44:16,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 19:44:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:16,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:16,449 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 627372497, now seen corresponding path program 40 times [2020-02-10 19:44:16,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822707953] [2020-02-10 19:44:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:16,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822707953] [2020-02-10 19:44:16,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:16,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502578702] [2020-02-10 19:44:16,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:16,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:16,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:16,864 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:44:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,027 INFO L93 Difference]: Finished difference Result 1363 states and 4825 transitions. [2020-02-10 19:44:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:17,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,030 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 19:44:17,030 INFO L226 Difference]: Without dead ends: 1345 [2020-02-10 19:44:17,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-02-10 19:44:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 785. [2020-02-10 19:44:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 19:44:17,071 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,071 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 19:44:17,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 19:44:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:17,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:17,074 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2039083063, now seen corresponding path program 41 times [2020-02-10 19:44:17,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267399267] [2020-02-10 19:44:17,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:17,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267399267] [2020-02-10 19:44:17,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:17,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723074793] [2020-02-10 19:44:17,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:17,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:17,517 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,654 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-02-10 19:44:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:17,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,658 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 19:44:17,659 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 19:44:17,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 19:44:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 19:44:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 19:44:17,683 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,683 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 19:44:17,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 19:44:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:17,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,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] [2020-02-10 19:44:17,684 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash 965997683, now seen corresponding path program 42 times [2020-02-10 19:44:17,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354017710] [2020-02-10 19:44:17,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,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 19:44:18,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354017710] [2020-02-10 19:44:18,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:18,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656937631] [2020-02-10 19:44:18,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:18,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:18,065 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,232 INFO L93 Difference]: Finished difference Result 1361 states and 4818 transitions. [2020-02-10 19:44:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:18,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,236 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 19:44:18,236 INFO L226 Difference]: Without dead ends: 1341 [2020-02-10 19:44:18,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-02-10 19:44:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 782. [2020-02-10 19:44:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 19:44:18,259 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 19:44:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,259 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 19:44:18,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 19:44:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:18,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,262 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1338386193, now seen corresponding path program 43 times [2020-02-10 19:44:18,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048284226] [2020-02-10 19:44:18,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:18,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048284226] [2020-02-10 19:44:18,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:18,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537909343] [2020-02-10 19:44:18,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:18,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:18,674 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:44:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,833 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-02-10 19:44:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:18,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,837 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 19:44:18,837 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 19:44:18,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 19:44:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-02-10 19:44:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 19:44:18,861 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 19:44:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,861 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 19:44:18,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 19:44:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:18,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,863 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1345640145, now seen corresponding path program 44 times [2020-02-10 19:44:18,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027685667] [2020-02-10 19:44:18,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:19,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027685667] [2020-02-10 19:44:19,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:19,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116359921] [2020-02-10 19:44:19,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:19,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:19,265 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:44:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,424 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-02-10 19:44:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:19,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,432 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 19:44:19,433 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 19:44:19,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 19:44:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-02-10 19:44:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 19:44:19,458 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,458 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 19:44:19,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 19:44:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:19,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,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] [2020-02-10 19:44:19,460 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1862489515, now seen corresponding path program 45 times [2020-02-10 19:44:19,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654574578] [2020-02-10 19:44:19,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:19,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654574578] [2020-02-10 19:44:19,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:19,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007077251] [2020-02-10 19:44:19,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:19,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:19,876 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,059 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 19:44:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:20,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,063 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:20,064 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 19:44:20,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 19:44:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 790. [2020-02-10 19:44:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 19:44:20,088 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 19:44:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,088 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 19:44:20,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 19:44:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:20,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,090 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1324633937, now seen corresponding path program 46 times [2020-02-10 19:44:20,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588110531] [2020-02-10 19:44:20,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:20,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588110531] [2020-02-10 19:44:20,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:20,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101201788] [2020-02-10 19:44:20,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:20,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:20,486 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:44:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,675 INFO L93 Difference]: Finished difference Result 1369 states and 4835 transitions. [2020-02-10 19:44:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:20,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,678 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 19:44:20,679 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:44:20,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:44:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 19:44:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 19:44:20,703 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 19:44:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,703 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 19:44:20,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 19:44:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:20,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:20,704 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1851986411, now seen corresponding path program 47 times [2020-02-10 19:44:20,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752820991] [2020-02-10 19:44:20,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:21,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752820991] [2020-02-10 19:44:21,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:21,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662816554] [2020-02-10 19:44:21,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:21,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:21,163 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:44:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,302 INFO L93 Difference]: Finished difference Result 1362 states and 4821 transitions. [2020-02-10 19:44:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:21,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,305 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 19:44:21,305 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:44:21,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:44:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-02-10 19:44:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 19:44:21,329 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 19:44:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,329 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 19:44:21,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 19:44:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:21,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:21,330 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:21,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1369895505, now seen corresponding path program 48 times [2020-02-10 19:44:21,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540216975] [2020-02-10 19:44:21,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:21,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540216975] [2020-02-10 19:44:21,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:21,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104056490] [2020-02-10 19:44:21,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:21,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:21,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:21,736 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:44:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,912 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-02-10 19:44:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:21,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,916 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:21,917 INFO L226 Difference]: Without dead ends: 1341 [2020-02-10 19:44:21,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-02-10 19:44:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 779. [2020-02-10 19:44:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:44:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3125 transitions. [2020-02-10 19:44:21,942 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3125 transitions. Word has length 25 [2020-02-10 19:44:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,942 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3125 transitions. [2020-02-10 19:44:21,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3125 transitions. [2020-02-10 19:44:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:21,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:21,943 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1224707533, now seen corresponding path program 49 times [2020-02-10 19:44:21,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228701652] [2020-02-10 19:44:21,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,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 19:44:22,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228701652] [2020-02-10 19:44:22,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:22,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028432669] [2020-02-10 19:44:22,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:22,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:22,355 INFO L87 Difference]: Start difference. First operand 779 states and 3125 transitions. Second operand 10 states. [2020-02-10 19:44:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,515 INFO L93 Difference]: Finished difference Result 1388 states and 4908 transitions. [2020-02-10 19:44:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:22,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,519 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:44:22,519 INFO L226 Difference]: Without dead ends: 1375 [2020-02-10 19:44:22,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-02-10 19:44:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 791. [2020-02-10 19:44:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-02-10 19:44:22,543 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-02-10 19:44:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,543 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-02-10 19:44:22,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-02-10 19:44:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:22,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:22,545 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -254455919, now seen corresponding path program 50 times [2020-02-10 19:44:22,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223222654] [2020-02-10 19:44:22,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44: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 19:44:22,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223222654] [2020-02-10 19:44:22,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:22,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869265265] [2020-02-10 19:44:22,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:22,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:22,949 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-02-10 19:44:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,091 INFO L93 Difference]: Finished difference Result 1390 states and 4908 transitions. [2020-02-10 19:44:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:23,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,095 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:44:23,095 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 19:44:23,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 19:44:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-02-10 19:44:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3155 transitions. [2020-02-10 19:44:23,121 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3155 transitions. Word has length 25 [2020-02-10 19:44:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,121 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3155 transitions. [2020-02-10 19:44:23,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3155 transitions. [2020-02-10 19:44:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:23,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:23,123 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1667606673, now seen corresponding path program 51 times [2020-02-10 19:44:23,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438662230] [2020-02-10 19:44:23,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:23,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438662230] [2020-02-10 19:44:23,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:23,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475749723] [2020-02-10 19:44:23,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:23,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:23,527 INFO L87 Difference]: Start difference. First operand 787 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:44:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,670 INFO L93 Difference]: Finished difference Result 1389 states and 4906 transitions. [2020-02-10 19:44:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:23,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,675 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:44:23,675 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:44:23,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:44:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-02-10 19:44:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-02-10 19:44:23,699 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-02-10 19:44:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,700 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-02-10 19:44:23,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-02-10 19:44:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:23,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:23,702 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash -676348851, now seen corresponding path program 52 times [2020-02-10 19:44:23,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513859471] [2020-02-10 19:44:23,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:24,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513859471] [2020-02-10 19:44:24,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:24,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332183367] [2020-02-10 19:44:24,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:24,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:24,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:24,103 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:44:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,302 INFO L93 Difference]: Finished difference Result 1392 states and 4908 transitions. [2020-02-10 19:44:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:24,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,306 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 19:44:24,306 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 19:44:24,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 19:44:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-02-10 19:44:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-02-10 19:44:24,331 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-02-10 19:44:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,331 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-02-10 19:44:24,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-02-10 19:44:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:24,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:24,333 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 409765491, now seen corresponding path program 53 times [2020-02-10 19:44:24,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027771287] [2020-02-10 19:44:24,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:24,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027771287] [2020-02-10 19:44:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:24,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339424248] [2020-02-10 19:44:24,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:24,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:24,761 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:44:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,913 INFO L93 Difference]: Finished difference Result 1395 states and 4916 transitions. [2020-02-10 19:44:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:24,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,918 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:44:24,918 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:44:24,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:44:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 793. [2020-02-10 19:44:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:44:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3162 transitions. [2020-02-10 19:44:24,942 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3162 transitions. Word has length 25 [2020-02-10 19:44:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,942 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3162 transitions. [2020-02-10 19:44:24,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3162 transitions. [2020-02-10 19:44:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:24,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:24,944 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash -663319889, now seen corresponding path program 54 times [2020-02-10 19:44:24,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227614916] [2020-02-10 19:44:24,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:25,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227614916] [2020-02-10 19:44:25,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:25,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625055223] [2020-02-10 19:44:25,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:25,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:25,357 INFO L87 Difference]: Start difference. First operand 793 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:44:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,516 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-02-10 19:44:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:25,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,520 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 19:44:25,521 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 19:44:25,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 19:44:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 783. [2020-02-10 19:44:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:44:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3140 transitions. [2020-02-10 19:44:25,545 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3140 transitions. Word has length 25 [2020-02-10 19:44:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,545 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3140 transitions. [2020-02-10 19:44:25,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3140 transitions. [2020-02-10 19:44:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:25,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:25,546 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1647193259, now seen corresponding path program 55 times [2020-02-10 19:44:25,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166630578] [2020-02-10 19:44:25,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,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 19:44:25,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166630578] [2020-02-10 19:44:25,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:25,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164661394] [2020-02-10 19:44:25,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:25,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:25,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:25,943 INFO L87 Difference]: Start difference. First operand 783 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:44:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,102 INFO L93 Difference]: Finished difference Result 1385 states and 4897 transitions. [2020-02-10 19:44:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:26,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,106 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 19:44:26,106 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 19:44:26,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 19:44:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 19:44:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-02-10 19:44:26,129 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-02-10 19:44:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,129 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-02-10 19:44:26,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-02-10 19:44:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:26,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:26,131 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:26,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,131 INFO L82 PathProgramCache]: Analyzing trace with hash -676941645, now seen corresponding path program 56 times [2020-02-10 19:44:26,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656414979] [2020-02-10 19:44:26,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:26,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656414979] [2020-02-10 19:44:26,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:26,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284552353] [2020-02-10 19:44:26,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:26,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:26,572 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:44:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,721 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-02-10 19:44:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:26,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,724 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:44:26,725 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:44:26,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:44:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 19:44:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-02-10 19:44:26,747 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-02-10 19:44:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,748 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-02-10 19:44:26,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-02-10 19:44:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:26,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,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] [2020-02-10 19:44:26,749 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash -164058321, now seen corresponding path program 57 times [2020-02-10 19:44:26,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068806478] [2020-02-10 19:44:26,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,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 19:44:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068806478] [2020-02-10 19:44:27,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:27,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829100451] [2020-02-10 19:44:27,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:27,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:27,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:27,162 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:44:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,318 INFO L93 Difference]: Finished difference Result 1384 states and 4891 transitions. [2020-02-10 19:44:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:27,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,322 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 19:44:27,323 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 19:44:27,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 19:44:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 791. [2020-02-10 19:44:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 19:44:27,346 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 19:44:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,347 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 19:44:27,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 19:44:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:27,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,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] [2020-02-10 19:44:27,349 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:27,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,349 INFO L82 PathProgramCache]: Analyzing trace with hash 837702605, now seen corresponding path program 58 times [2020-02-10 19:44:27,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765344786] [2020-02-10 19:44:27,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:27,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765344786] [2020-02-10 19:44:27,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:27,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991755859] [2020-02-10 19:44:27,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:27,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:27,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:27,746 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:44:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,893 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-02-10 19:44:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:27,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,897 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 19:44:27,897 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 19:44:27,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 19:44:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 787. [2020-02-10 19:44:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 19:44:27,920 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 19:44:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,920 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 19:44:27,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 19:44:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:27,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:27,922 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 312875989, now seen corresponding path program 59 times [2020-02-10 19:44:27,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078638133] [2020-02-10 19:44:27,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:28,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078638133] [2020-02-10 19:44:28,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:28,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026110929] [2020-02-10 19:44:28,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:28,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:28,336 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:44:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,515 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 19:44:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:28,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,519 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:44:28,520 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:44:28,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:44:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-02-10 19:44:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:44:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3156 transitions. [2020-02-10 19:44:28,543 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3156 transitions. Word has length 25 [2020-02-10 19:44:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,543 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3156 transitions. [2020-02-10 19:44:28,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3156 transitions. [2020-02-10 19:44:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:28,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:28,545 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 850731567, now seen corresponding path program 60 times [2020-02-10 19:44:28,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083375872] [2020-02-10 19:44:28,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,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 19:44:28,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083375872] [2020-02-10 19:44:28,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:28,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467219391] [2020-02-10 19:44:28,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:28,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:28,926 INFO L87 Difference]: Start difference. First operand 792 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:44:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,071 INFO L93 Difference]: Finished difference Result 1388 states and 4891 transitions. [2020-02-10 19:44:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:29,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,074 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:44:29,074 INFO L226 Difference]: Without dead ends: 1365 [2020-02-10 19:44:29,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-02-10 19:44:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 783. [2020-02-10 19:44:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:44:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3136 transitions. [2020-02-10 19:44:29,098 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3136 transitions. Word has length 25 [2020-02-10 19:44:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,098 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3136 transitions. [2020-02-10 19:44:29,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3136 transitions. [2020-02-10 19:44:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:29,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:29,099 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1359903445, now seen corresponding path program 61 times [2020-02-10 19:44:29,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781330172] [2020-02-10 19:44:29,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,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 19:44:29,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781330172] [2020-02-10 19:44:29,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:29,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959012661] [2020-02-10 19:44:29,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:29,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:29,518 INFO L87 Difference]: Start difference. First operand 783 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:44:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,684 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-02-10 19:44:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:29,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,688 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:44:29,688 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:44:29,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:44:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-02-10 19:44:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 19:44:29,713 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 19:44:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,713 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 19:44:29,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 19:44:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:29,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:29,714 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1943806029, now seen corresponding path program 62 times [2020-02-10 19:44:29,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582403630] [2020-02-10 19:44:29,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:30,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582403630] [2020-02-10 19:44:30,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:30,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649800879] [2020-02-10 19:44:30,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:30,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:30,093 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:44:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,244 INFO L93 Difference]: Finished difference Result 1390 states and 4899 transitions. [2020-02-10 19:44:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:30,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,248 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:44:30,249 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 19:44:30,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 19:44:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 19:44:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 19:44:30,272 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 19:44:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,272 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 19:44:30,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 19:44:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:30,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:30,273 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1009029773, now seen corresponding path program 63 times [2020-02-10 19:44:30,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137734013] [2020-02-10 19:44:30,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:30,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137734013] [2020-02-10 19:44:30,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:30,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751045244] [2020-02-10 19:44:30,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:30,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:30,684 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:44:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,831 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-02-10 19:44:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:30,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,835 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 19:44:30,836 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 19:44:30,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 19:44:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 19:44:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-02-10 19:44:30,859 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-02-10 19:44:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,859 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-02-10 19:44:30,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-02-10 19:44:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:30,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:30,861 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -7268847, now seen corresponding path program 64 times [2020-02-10 19:44:30,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202419936] [2020-02-10 19:44:30,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:31,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202419936] [2020-02-10 19:44:31,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:31,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858574449] [2020-02-10 19:44:31,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:31,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:31,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:31,268 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:44:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,417 INFO L93 Difference]: Finished difference Result 1386 states and 4887 transitions. [2020-02-10 19:44:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:31,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,422 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 19:44:31,422 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:44:31,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:44:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 19:44:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3143 transitions. [2020-02-10 19:44:31,445 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3143 transitions. Word has length 25 [2020-02-10 19:44:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,446 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3143 transitions. [2020-02-10 19:44:31,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3143 transitions. [2020-02-10 19:44:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:31,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:31,447 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -953988395, now seen corresponding path program 65 times [2020-02-10 19:44:31,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893866098] [2020-02-10 19:44:31,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:31,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893866098] [2020-02-10 19:44:31,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:31,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050470402] [2020-02-10 19:44:31,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:31,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:31,828 INFO L87 Difference]: Start difference. First operand 787 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:44:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,986 INFO L93 Difference]: Finished difference Result 1392 states and 4900 transitions. [2020-02-10 19:44:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:31,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,991 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 19:44:31,991 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:44:31,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:44:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-02-10 19:44:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:44:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3152 transitions. [2020-02-10 19:44:32,015 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,015 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3152 transitions. [2020-02-10 19:44:32,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3152 transitions. [2020-02-10 19:44:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:32,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:32,017 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:32,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,017 INFO L82 PathProgramCache]: Analyzing trace with hash 656952563, now seen corresponding path program 66 times [2020-02-10 19:44:32,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135151057] [2020-02-10 19:44:32,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:32,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135151057] [2020-02-10 19:44:32,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:32,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958313667] [2020-02-10 19:44:32,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:32,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:32,398 INFO L87 Difference]: Start difference. First operand 792 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,564 INFO L93 Difference]: Finished difference Result 1390 states and 4891 transitions. [2020-02-10 19:44:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:32,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,568 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:44:32,568 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 19:44:32,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 19:44:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-02-10 19:44:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:44:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-02-10 19:44:32,591 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-02-10 19:44:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,591 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-02-10 19:44:32,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-02-10 19:44:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:32,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:32,593 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1029341073, now seen corresponding path program 67 times [2020-02-10 19:44:32,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90534864] [2020-02-10 19:44:32,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:33,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90534864] [2020-02-10 19:44:33,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:33,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946404371] [2020-02-10 19:44:33,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:33,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:33,007 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:44:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,143 INFO L93 Difference]: Finished difference Result 1399 states and 4924 transitions. [2020-02-10 19:44:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:33,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,147 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:44:33,147 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 19:44:33,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 19:44:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 794. [2020-02-10 19:44:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:44:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 19:44:33,170 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 19:44:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,170 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 19:44:33,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 19:44:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:33,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:33,172 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash -43744307, now seen corresponding path program 68 times [2020-02-10 19:44:33,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075663487] [2020-02-10 19:44:33,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:33,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075663487] [2020-02-10 19:44:33,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:33,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477235028] [2020-02-10 19:44:33,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:33,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:33,590 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:44:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,732 INFO L93 Difference]: Finished difference Result 1400 states and 4920 transitions. [2020-02-10 19:44:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:33,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,736 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 19:44:33,736 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 19:44:33,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 19:44:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 788. [2020-02-10 19:44:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 19:44:33,760 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,760 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 19:44:33,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 19:44:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:33,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:33,761 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash -571096781, now seen corresponding path program 69 times [2020-02-10 19:44:33,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919252417] [2020-02-10 19:44:33,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:34,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919252417] [2020-02-10 19:44:34,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:34,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334332798] [2020-02-10 19:44:34,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:34,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:34,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:34,170 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,296 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-02-10 19:44:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:34,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,300 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 19:44:34,300 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 19:44:34,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 19:44:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 793. [2020-02-10 19:44:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:44:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-02-10 19:44:34,323 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-02-10 19:44:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,323 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-02-10 19:44:34,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-02-10 19:44:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:34,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:34,325 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash -33241203, now seen corresponding path program 70 times [2020-02-10 19:44:34,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50137223] [2020-02-10 19:44:34,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:34,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50137223] [2020-02-10 19:44:34,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:34,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042246239] [2020-02-10 19:44:34,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:34,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:34,726 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:44:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,872 INFO L93 Difference]: Finished difference Result 1395 states and 4905 transitions. [2020-02-10 19:44:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:34,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,877 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:44:34,877 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:44:34,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:44:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 788. [2020-02-10 19:44:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3141 transitions. [2020-02-10 19:44:34,901 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,901 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3141 transitions. [2020-02-10 19:44:34,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3141 transitions. [2020-02-10 19:44:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:34,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:34,902 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash -550090573, now seen corresponding path program 71 times [2020-02-10 19:44:34,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234858186] [2020-02-10 19:44:34,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:35,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234858186] [2020-02-10 19:44:35,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:35,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166458193] [2020-02-10 19:44:35,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:35,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:35,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:35,346 INFO L87 Difference]: Start difference. First operand 788 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,500 INFO L93 Difference]: Finished difference Result 1398 states and 4911 transitions. [2020-02-10 19:44:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:35,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,504 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 19:44:35,504 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 19:44:35,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 19:44:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 793. [2020-02-10 19:44:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:44:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3150 transitions. [2020-02-10 19:44:35,529 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3150 transitions. Word has length 25 [2020-02-10 19:44:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,530 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3150 transitions. [2020-02-10 19:44:35,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3150 transitions. [2020-02-10 19:44:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:35,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:35,531 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1060850385, now seen corresponding path program 72 times [2020-02-10 19:44:35,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84695545] [2020-02-10 19:44:35,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:35,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84695545] [2020-02-10 19:44:35,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:35,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439794489] [2020-02-10 19:44:35,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:35,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:35,930 INFO L87 Difference]: Start difference. First operand 793 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:44:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,065 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-02-10 19:44:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:36,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,069 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 19:44:36,069 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:44:36,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:44:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 779. [2020-02-10 19:44:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:44:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3122 transitions. [2020-02-10 19:44:36,094 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3122 transitions. Word has length 25 [2020-02-10 19:44:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,095 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3122 transitions. [2020-02-10 19:44:36,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3122 transitions. [2020-02-10 19:44:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:36,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:36,096 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 66685201, now seen corresponding path program 73 times [2020-02-10 19:44:36,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922773225] [2020-02-10 19:44:36,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:36,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922773225] [2020-02-10 19:44:36,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:36,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803514295] [2020-02-10 19:44:36,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:36,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:36,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:36,482 INFO L87 Difference]: Start difference. First operand 779 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:44:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,620 INFO L93 Difference]: Finished difference Result 1362 states and 4829 transitions. [2020-02-10 19:44:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:36,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,624 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 19:44:36,624 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 19:44:36,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 19:44:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-02-10 19:44:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 19:44:36,647 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,647 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 19:44:36,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 19:44:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:36,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:36,648 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1047439919, now seen corresponding path program 74 times [2020-02-10 19:44:36,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004900590] [2020-02-10 19:44:36,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,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 19:44:37,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004900590] [2020-02-10 19:44:37,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:37,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054281252] [2020-02-10 19:44:37,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:37,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:37,052 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,207 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-02-10 19:44:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:37,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,211 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 19:44:37,211 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 19:44:37,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 19:44:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-02-10 19:44:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 19:44:37,234 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 19:44:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,234 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 19:44:37,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 19:44:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:37,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:37,235 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1992719279, now seen corresponding path program 75 times [2020-02-10 19:44:37,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547528764] [2020-02-10 19:44:37,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547528764] [2020-02-10 19:44:37,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:37,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18353638] [2020-02-10 19:44:37,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:37,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:37,635 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:44:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,762 INFO L93 Difference]: Finished difference Result 1367 states and 4837 transitions. [2020-02-10 19:44:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:37,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,766 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 19:44:37,766 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 19:44:37,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 19:44:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-02-10 19:44:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:44:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 19:44:37,789 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 19:44:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,789 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 19:44:37,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 19:44:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:37,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:37,791 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1310990195, now seen corresponding path program 76 times [2020-02-10 19:44:37,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275107022] [2020-02-10 19:44:37,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:38,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275107022] [2020-02-10 19:44:38,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:38,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322033985] [2020-02-10 19:44:38,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:38,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:38,195 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:44:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,354 INFO L93 Difference]: Finished difference Result 1370 states and 4839 transitions. [2020-02-10 19:44:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:38,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,358 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:38,358 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:44:38,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:44:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 19:44:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 19:44:38,382 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,382 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 19:44:38,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 19:44:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:38,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:38,383 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1711661329, now seen corresponding path program 77 times [2020-02-10 19:44:38,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119239896] [2020-02-10 19:44:38,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,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 19:44:38,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119239896] [2020-02-10 19:44:38,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:38,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037154018] [2020-02-10 19:44:38,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:38,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:38,786 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,912 INFO L93 Difference]: Finished difference Result 1364 states and 4827 transitions. [2020-02-10 19:44:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:38,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,916 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:38,916 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 19:44:38,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 19:44:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 19:44:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 19:44:38,940 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,940 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 19:44:38,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 19:44:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:38,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:38,941 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,942 INFO L82 PathProgramCache]: Analyzing trace with hash -972365009, now seen corresponding path program 78 times [2020-02-10 19:44:38,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625754111] [2020-02-10 19:44:38,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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 19:44:39,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625754111] [2020-02-10 19:44:39,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:39,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244380858] [2020-02-10 19:44:39,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:39,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:39,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:39,319 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,474 INFO L93 Difference]: Finished difference Result 1368 states and 4832 transitions. [2020-02-10 19:44:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:39,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,478 INFO L225 Difference]: With dead ends: 1368 [2020-02-10 19:44:39,479 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 19:44:39,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 19:44:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-02-10 19:44:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 19:44:39,503 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 19:44:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,504 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 19:44:39,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 19:44:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:39,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,506 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:39,506 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -355800525, now seen corresponding path program 79 times [2020-02-10 19:44:39,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83708883] [2020-02-10 19:44:39,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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 19:44:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83708883] [2020-02-10 19:44:39,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:39,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144106202] [2020-02-10 19:44:39,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:39,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:39,921 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:44:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,073 INFO L93 Difference]: Finished difference Result 1360 states and 4822 transitions. [2020-02-10 19:44:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:40,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,078 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 19:44:40,078 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 19:44:40,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 19:44:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 19:44:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 19:44:40,103 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 19:44:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,103 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 19:44:40,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 19:44:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:40,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:40,105 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 624954193, now seen corresponding path program 80 times [2020-02-10 19:44:40,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956880229] [2020-02-10 19:44:40,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:40,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 19:44:40,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956880229] [2020-02-10 19:44:40,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:40,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:40,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148512373] [2020-02-10 19:44:40,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:40,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:40,503 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:44:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,682 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-02-10 19:44:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:40,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,685 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 19:44:40,685 INFO L226 Difference]: Without dead ends: 1344 [2020-02-10 19:44:40,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-02-10 19:44:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-02-10 19:44:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 19:44:40,732 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,733 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 19:44:40,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 19:44:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:40,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:40,736 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -798699665, now seen corresponding path program 81 times [2020-02-10 19:44:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705022248] [2020-02-10 19:44:40,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:41,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705022248] [2020-02-10 19:44:41,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:41,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063029718] [2020-02-10 19:44:41,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:41,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:41,176 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,323 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-02-10 19:44:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:41,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,328 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 19:44:41,328 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:44:41,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:44:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 789. [2020-02-10 19:44:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:44:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 19:44:41,355 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 19:44:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,355 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 19:44:41,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 19:44:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:41,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:41,357 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,357 INFO L82 PathProgramCache]: Analyzing trace with hash 203061261, now seen corresponding path program 82 times [2020-02-10 19:44:41,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506792566] [2020-02-10 19:44:41,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:41,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506792566] [2020-02-10 19:44:41,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:41,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745540319] [2020-02-10 19:44:41,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:41,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:41,746 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:44:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,882 INFO L93 Difference]: Finished difference Result 1364 states and 4824 transitions. [2020-02-10 19:44:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:41,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,886 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:41,886 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 19:44:41,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 19:44:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-02-10 19:44:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 19:44:41,909 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 19:44:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,909 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 19:44:41,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 19:44:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:41,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,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] [2020-02-10 19:44:41,911 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1614771827, now seen corresponding path program 83 times [2020-02-10 19:44:41,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961976076] [2020-02-10 19:44:41,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,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 19:44:42,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961976076] [2020-02-10 19:44:42,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:42,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154440945] [2020-02-10 19:44:42,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:42,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:42,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:42,294 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:44:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,429 INFO L93 Difference]: Finished difference Result 1360 states and 4816 transitions. [2020-02-10 19:44:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:42,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,433 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 19:44:42,433 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 19:44:42,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 19:44:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 788. [2020-02-10 19:44:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 19:44:42,456 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 19:44:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,456 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 19:44:42,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 19:44:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:42,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:42,457 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash 541686447, now seen corresponding path program 84 times [2020-02-10 19:44:42,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93459042] [2020-02-10 19:44:42,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:42,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93459042] [2020-02-10 19:44:42,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:42,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831875506] [2020-02-10 19:44:42,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:42,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:42,861 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:44:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,013 INFO L93 Difference]: Finished difference Result 1362 states and 4817 transitions. [2020-02-10 19:44:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:43,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,017 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 19:44:43,017 INFO L226 Difference]: Without dead ends: 1342 [2020-02-10 19:44:43,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-02-10 19:44:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 782. [2020-02-10 19:44:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-02-10 19:44:43,042 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-02-10 19:44:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,043 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-02-10 19:44:43,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-02-10 19:44:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:43,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:43,045 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1147747827, now seen corresponding path program 85 times [2020-02-10 19:44:43,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411832557] [2020-02-10 19:44:43,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,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 19:44:43,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411832557] [2020-02-10 19:44:43,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:43,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067784906] [2020-02-10 19:44:43,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:43,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:43,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:43,426 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:44:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,555 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-02-10 19:44:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:43,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,560 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 19:44:43,560 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 19:44:43,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 19:44:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 790. [2020-02-10 19:44:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-02-10 19:44:43,583 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,583 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-02-10 19:44:43,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-02-10 19:44:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:43,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:43,584 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2139005649, now seen corresponding path program 86 times [2020-02-10 19:44:43,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929504284] [2020-02-10 19:44:43,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:43,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929504284] [2020-02-10 19:44:43,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:43,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060982752] [2020-02-10 19:44:43,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:43,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:43,956 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,103 INFO L93 Difference]: Finished difference Result 1376 states and 4853 transitions. [2020-02-10 19:44:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:44,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,107 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:44:44,108 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 19:44:44,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 19:44:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 786. [2020-02-10 19:44:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:44:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3141 transitions. [2020-02-10 19:44:44,131 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,131 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3141 transitions. [2020-02-10 19:44:44,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3141 transitions. [2020-02-10 19:44:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:44,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:44,132 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1221185391, now seen corresponding path program 87 times [2020-02-10 19:44:44,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025027645] [2020-02-10 19:44:44,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:44,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025027645] [2020-02-10 19:44:44,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:44,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45721242] [2020-02-10 19:44:44,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:44,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:44,520 INFO L87 Difference]: Start difference. First operand 786 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,671 INFO L93 Difference]: Finished difference Result 1371 states and 4843 transitions. [2020-02-10 19:44:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:44,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,675 INFO L225 Difference]: With dead ends: 1371 [2020-02-10 19:44:44,675 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:44:44,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:44:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-02-10 19:44:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 19:44:44,698 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 19:44:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,698 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 19:44:44,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 19:44:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:44,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,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] [2020-02-10 19:44:44,699 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -219424465, now seen corresponding path program 88 times [2020-02-10 19:44:44,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873877859] [2020-02-10 19:44:44,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:45,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873877859] [2020-02-10 19:44:45,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:45,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184303289] [2020-02-10 19:44:45,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:45,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:45,078 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:44:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,240 INFO L93 Difference]: Finished difference Result 1372 states and 4841 transitions. [2020-02-10 19:44:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:45,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,244 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:44:45,256 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 19:44:45,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 19:44:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 786. [2020-02-10 19:44:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:44:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-02-10 19:44:45,278 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-02-10 19:44:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,278 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-02-10 19:44:45,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-02-10 19:44:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:45,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,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] [2020-02-10 19:44:45,280 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1166144013, now seen corresponding path program 89 times [2020-02-10 19:44:45,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870117028] [2020-02-10 19:44:45,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:45,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870117028] [2020-02-10 19:44:45,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:45,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763958824] [2020-02-10 19:44:45,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:45,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:45,664 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:44:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,823 INFO L93 Difference]: Finished difference Result 1378 states and 4854 transitions. [2020-02-10 19:44:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:45,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,827 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 19:44:45,827 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 19:44:45,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 19:44:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 791. [2020-02-10 19:44:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 19:44:45,851 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,851 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 19:44:45,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 19:44:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:45,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:45,852 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,852 INFO L82 PathProgramCache]: Analyzing trace with hash 444796945, now seen corresponding path program 90 times [2020-02-10 19:44:45,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809145066] [2020-02-10 19:44:45,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:46,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809145066] [2020-02-10 19:44:46,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:46,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899383951] [2020-02-10 19:44:46,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:46,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:46,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:46,237 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,375 INFO L93 Difference]: Finished difference Result 1376 states and 4845 transitions. [2020-02-10 19:44:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:46,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,379 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:44:46,379 INFO L226 Difference]: Without dead ends: 1353 [2020-02-10 19:44:46,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-02-10 19:44:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 782. [2020-02-10 19:44:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 19:44:46,405 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 19:44:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,405 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 19:44:46,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 19:44:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:46,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:46,406 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1963730385, now seen corresponding path program 91 times [2020-02-10 19:44:46,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378560796] [2020-02-10 19:44:46,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,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 19:44:46,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378560796] [2020-02-10 19:44:46,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:46,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160630773] [2020-02-10 19:44:46,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:46,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:46,790 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:44:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,943 INFO L93 Difference]: Finished difference Result 1366 states and 4829 transitions. [2020-02-10 19:44:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:46,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,947 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 19:44:46,947 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 19:44:46,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 19:44:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-02-10 19:44:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 19:44:46,970 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 19:44:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,970 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 19:44:46,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 19:44:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:46,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:46,972 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -352789427, now seen corresponding path program 92 times [2020-02-10 19:44:46,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34369135] [2020-02-10 19:44:46,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:47,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34369135] [2020-02-10 19:44:47,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:47,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62138530] [2020-02-10 19:44:47,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:47,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:47,355 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:44:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,498 INFO L93 Difference]: Finished difference Result 1370 states and 4834 transitions. [2020-02-10 19:44:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:47,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,502 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:47,502 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 19:44:47,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 19:44:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 785. [2020-02-10 19:44:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 19:44:47,526 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 19:44:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,526 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 19:44:47,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 19:44:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:47,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:47,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] [2020-02-10 19:44:47,527 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash 730799057, now seen corresponding path program 93 times [2020-02-10 19:44:47,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137338074] [2020-02-10 19:44:47,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:47,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137338074] [2020-02-10 19:44:47,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:47,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310830922] [2020-02-10 19:44:47,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:47,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:47,911 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:44:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,072 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-02-10 19:44:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:48,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,075 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 19:44:48,076 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 19:44:48,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 19:44:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 19:44:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 19:44:48,098 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 19:44:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,098 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 19:44:48,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 19:44:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:48,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:48,100 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash -342286323, now seen corresponding path program 94 times [2020-02-10 19:44:48,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600663327] [2020-02-10 19:44:48,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,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 19:44:48,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600663327] [2020-02-10 19:44:48,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:48,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311435224] [2020-02-10 19:44:48,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:48,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:48,475 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:44:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,626 INFO L93 Difference]: Finished difference Result 1366 states and 4823 transitions. [2020-02-10 19:44:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:48,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,630 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 19:44:48,631 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 19:44:48,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:48,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 19:44:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 785. [2020-02-10 19:44:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-02-10 19:44:48,654 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-02-10 19:44:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,654 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-02-10 19:44:48,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-02-10 19:44:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:48,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:48,656 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash 741302161, now seen corresponding path program 95 times [2020-02-10 19:44:48,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305197264] [2020-02-10 19:44:48,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:49,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305197264] [2020-02-10 19:44:49,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:49,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73401670] [2020-02-10 19:44:49,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:49,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:49,058 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:44:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,230 INFO L93 Difference]: Finished difference Result 1374 states and 4841 transitions. [2020-02-10 19:44:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:49,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,234 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 19:44:49,234 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:44:49,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:44:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-02-10 19:44:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-02-10 19:44:49,260 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,260 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-02-10 19:44:49,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-02-10 19:44:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:49,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:49,262 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1942724177, now seen corresponding path program 96 times [2020-02-10 19:44:49,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510798246] [2020-02-10 19:44:49,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:49,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510798246] [2020-02-10 19:44:49,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:49,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784066263] [2020-02-10 19:44:49,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:49,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:49,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:49,639 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,800 INFO L93 Difference]: Finished difference Result 1372 states and 4832 transitions. [2020-02-10 19:44:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:49,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,804 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:44:49,804 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 19:44:49,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 19:44:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 779. [2020-02-10 19:44:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:44:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3119 transitions. [2020-02-10 19:44:49,828 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3119 transitions. Word has length 25 [2020-02-10 19:44:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,828 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3119 transitions. [2020-02-10 19:44:49,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3119 transitions. [2020-02-10 19:44:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:49,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:49,830 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2073967317, now seen corresponding path program 97 times [2020-02-10 19:44:49,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025584672] [2020-02-10 19:44:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,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 19:44:50,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025584672] [2020-02-10 19:44:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:50,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995458791] [2020-02-10 19:44:50,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:50,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:50,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:50,208 INFO L87 Difference]: Start difference. First operand 779 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:44:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,363 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-02-10 19:44:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:50,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,367 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:44:50,367 INFO L226 Difference]: Without dead ends: 1361 [2020-02-10 19:44:50,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-02-10 19:44:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 788. [2020-02-10 19:44:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 19:44:50,390 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 19:44:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,390 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 19:44:50,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 19:44:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:50,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,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] [2020-02-10 19:44:50,391 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash -610059021, now seen corresponding path program 98 times [2020-02-10 19:44:50,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304391070] [2020-02-10 19:44:50,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,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 19:44:50,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304391070] [2020-02-10 19:44:50,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:50,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910939743] [2020-02-10 19:44:50,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:50,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:50,771 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:44:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,906 INFO L93 Difference]: Finished difference Result 1373 states and 4852 transitions. [2020-02-10 19:44:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:50,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,910 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 19:44:50,910 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:44:50,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:44:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-02-10 19:44:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 19:44:50,933 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,933 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 19:44:50,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 19:44:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:50,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:50,935 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 473529463, now seen corresponding path program 99 times [2020-02-10 19:44:50,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851717305] [2020-02-10 19:44:50,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,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 19:44:51,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851717305] [2020-02-10 19:44:51,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:51,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502367597] [2020-02-10 19:44:51,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:51,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:51,316 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,460 INFO L93 Difference]: Finished difference Result 1383 states and 4875 transitions. [2020-02-10 19:44:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:51,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,464 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 19:44:51,464 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:44:51,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:44:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 791. [2020-02-10 19:44:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:44:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-02-10 19:44:51,487 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-02-10 19:44:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,488 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-02-10 19:44:51,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-02-10 19:44:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:51,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,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] [2020-02-10 19:44:51,489 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -599555917, now seen corresponding path program 100 times [2020-02-10 19:44:51,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673995723] [2020-02-10 19:44:51,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:51,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673995723] [2020-02-10 19:44:51,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:51,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734672195] [2020-02-10 19:44:51,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:51,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:51,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:51,871 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:44:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,026 INFO L93 Difference]: Finished difference Result 1384 states and 4871 transitions. [2020-02-10 19:44:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:52,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,030 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 19:44:52,030 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 19:44:52,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 19:44:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 785. [2020-02-10 19:44:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 19:44:52,053 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 19:44:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,053 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 19:44:52,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 19:44:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:52,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,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] [2020-02-10 19:44:52,054 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash 484032567, now seen corresponding path program 101 times [2020-02-10 19:44:52,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040581717] [2020-02-10 19:44:52,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,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 19:44:52,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040581717] [2020-02-10 19:44:52,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:52,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425998129] [2020-02-10 19:44:52,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:52,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:52,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:52,452 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:44:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,576 INFO L93 Difference]: Finished difference Result 1374 states and 4851 transitions. [2020-02-10 19:44:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:52,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,580 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 19:44:52,580 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 19:44:52,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 19:44:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 788. [2020-02-10 19:44:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 19:44:52,603 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 19:44:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,604 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 19:44:52,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 19:44:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:52,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:52,605 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2094973525, now seen corresponding path program 102 times [2020-02-10 19:44:52,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224074496] [2020-02-10 19:44:52,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:52,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224074496] [2020-02-10 19:44:52,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:52,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536613078] [2020-02-10 19:44:52,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:52,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:52,986 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:44:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,123 INFO L93 Difference]: Finished difference Result 1378 states and 4856 transitions. [2020-02-10 19:44:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:53,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,127 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 19:44:53,127 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 19:44:53,127 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 19:44:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 782. [2020-02-10 19:44:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-02-10 19:44:53,152 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-02-10 19:44:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,152 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-02-10 19:44:53,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-02-10 19:44:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:53,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:53,154 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -294965901, now seen corresponding path program 103 times [2020-02-10 19:44:53,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77345832] [2020-02-10 19:44:53,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:53,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77345832] [2020-02-10 19:44:53,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:53,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680470237] [2020-02-10 19:44:53,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:53,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:53,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:53,546 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:44:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,695 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-02-10 19:44:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:53,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,700 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 19:44:53,700 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:44:53,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:44:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 19:44:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 19:44:53,733 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 19:44:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,734 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 19:44:53,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 19:44:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:53,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:53,736 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1315975057, now seen corresponding path program 104 times [2020-02-10 19:44:53,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437294576] [2020-02-10 19:44:53,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:54,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437294576] [2020-02-10 19:44:54,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:54,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995107291] [2020-02-10 19:44:54,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:54,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:54,143 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:44:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,284 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 19:44:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:54,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,288 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:44:54,288 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 19:44:54,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 19:44:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-02-10 19:44:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 19:44:54,311 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 19:44:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,312 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 19:44:54,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 19:44:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:54,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44: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] [2020-02-10 19:44:54,314 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash 799125687, now seen corresponding path program 105 times [2020-02-10 19:44:54,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980064982] [2020-02-10 19:44:54,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:54,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980064982] [2020-02-10 19:44:54,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:54,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504388718] [2020-02-10 19:44:54,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:54,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:54,718 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:44:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,858 INFO L93 Difference]: Finished difference Result 1377 states and 4858 transitions. [2020-02-10 19:44:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:54,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,862 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 19:44:54,862 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 19:44:54,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 19:44:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 790. [2020-02-10 19:44:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:44:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-02-10 19:44:54,890 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-02-10 19:44:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,891 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-02-10 19:44:54,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-02-10 19:44:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:54,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,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] [2020-02-10 19:44:54,893 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1336981265, now seen corresponding path program 106 times [2020-02-10 19:44:54,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408249372] [2020-02-10 19:44:54,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:55,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408249372] [2020-02-10 19:44:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:55,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583464741] [2020-02-10 19:44:55,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:55,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:55,275 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:44:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,413 INFO L93 Difference]: Finished difference Result 1376 states and 4851 transitions. [2020-02-10 19:44:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:55,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,417 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:44:55,418 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 19:44:55,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 19:44:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-02-10 19:44:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:44:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 19:44:55,440 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 19:44:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,441 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 19:44:55,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 19:44:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:55,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,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] [2020-02-10 19:44:55,442 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash 809628791, now seen corresponding path program 107 times [2020-02-10 19:44:55,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387822184] [2020-02-10 19:44:55,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:55,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387822184] [2020-02-10 19:44:55,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:55,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847671981] [2020-02-10 19:44:55,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:55,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:55,808 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:44:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,963 INFO L93 Difference]: Finished difference Result 1369 states and 4837 transitions. [2020-02-10 19:44:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:55,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,967 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 19:44:55,967 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 19:44:55,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 19:44:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-02-10 19:44:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:44:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 19:44:55,991 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 19:44:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,992 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 19:44:55,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 19:44:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:55,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,993 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash -263456589, now seen corresponding path program 108 times [2020-02-10 19:44:55,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460464924] [2020-02-10 19:44:55,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:56,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460464924] [2020-02-10 19:44:56,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:56,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567720964] [2020-02-10 19:44:56,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:56,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:56,361 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:44:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,510 INFO L93 Difference]: Finished difference Result 1371 states and 4838 transitions. [2020-02-10 19:44:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:56,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,514 INFO L225 Difference]: With dead ends: 1371 [2020-02-10 19:44:56,514 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 19:44:56,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 19:44:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 782. [2020-02-10 19:44:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 19:44:56,538 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 19:44:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,538 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 19:44:56,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 19:44:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:56,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:56,540 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 30630323, now seen corresponding path program 109 times [2020-02-10 19:44:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820105710] [2020-02-10 19:44:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:56,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820105710] [2020-02-10 19:44:56,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:56,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677345270] [2020-02-10 19:44:56,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:56,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:56,934 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:44:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,091 INFO L93 Difference]: Finished difference Result 1391 states and 4896 transitions. [2020-02-10 19:44:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:57,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,094 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 19:44:57,095 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:44:57,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:44:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 793. [2020-02-10 19:44:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:44:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 19:44:57,118 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 19:44:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,118 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 19:44:57,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 19:44:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:57,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:57,119 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1042455057, now seen corresponding path program 110 times [2020-02-10 19:44:57,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233699181] [2020-02-10 19:44:57,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,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 19:44:57,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233699181] [2020-02-10 19:44:57,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:57,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730161689] [2020-02-10 19:44:57,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:57,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:57,502 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:44:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,647 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-02-10 19:44:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:57,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,651 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 19:44:57,652 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 19:44:57,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 19:44:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 19:44:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 19:44:57,675 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 19:44:57,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,675 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 19:44:57,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 19:44:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:57,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:57,676 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1569807531, now seen corresponding path program 111 times [2020-02-10 19:44:57,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7208776] [2020-02-10 19:44:57,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7208776] [2020-02-10 19:44:58,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:58,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797636182] [2020-02-10 19:44:58,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:58,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:58,061 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:44:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,224 INFO L93 Difference]: Finished difference Result 1388 states and 4884 transitions. [2020-02-10 19:44:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:58,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,228 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:44:58,228 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:44:58,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:44:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 792. [2020-02-10 19:44:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:44:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3150 transitions. [2020-02-10 19:44:58,251 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3150 transitions. Word has length 25 [2020-02-10 19:44:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,251 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3150 transitions. [2020-02-10 19:44:58,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3150 transitions. [2020-02-10 19:44:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:58,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:58,252 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1031951953, now seen corresponding path program 112 times [2020-02-10 19:44:58,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275282299] [2020-02-10 19:44:58,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275282299] [2020-02-10 19:44:58,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:58,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691785274] [2020-02-10 19:44:58,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:58,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:58,639 INFO L87 Difference]: Start difference. First operand 792 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:44:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,783 INFO L93 Difference]: Finished difference Result 1387 states and 4877 transitions. [2020-02-10 19:44:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:58,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,787 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:44:58,787 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:44:58,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:44:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 19:44:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:44:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-02-10 19:44:58,810 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-02-10 19:44:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,810 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-02-10 19:44:58,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-02-10 19:44:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:58,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:58,811 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1548801323, now seen corresponding path program 113 times [2020-02-10 19:44:58,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163658493] [2020-02-10 19:44:58,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,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 19:44:59,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163658493] [2020-02-10 19:44:59,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:59,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338602896] [2020-02-10 19:44:59,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:59,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:59,191 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:44:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,321 INFO L93 Difference]: Finished difference Result 1390 states and 4883 transitions. [2020-02-10 19:44:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:59,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,325 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:44:59,325 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:44:59,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:44:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-02-10 19:44:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:44:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 19:44:59,352 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 19:44:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,352 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 19:44:59,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 19:44:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:59,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,354 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,354 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 62139635, now seen corresponding path program 114 times [2020-02-10 19:44:59,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295922011] [2020-02-10 19:44:59,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,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 19:44:59,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295922011] [2020-02-10 19:44:59,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:44:59,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342161585] [2020-02-10 19:44:59,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:44:59,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:44:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:44:59,749 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:44:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,913 INFO L93 Difference]: Finished difference Result 1388 states and 4874 transitions. [2020-02-10 19:44:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:44:59,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:44:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,917 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:44:59,917 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:44:59,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:44:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 782. [2020-02-10 19:44:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:44:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-02-10 19:44:59,940 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-02-10 19:44:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,940 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-02-10 19:44:59,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:44:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-02-10 19:44:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:44:59,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,942 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1967167505, now seen corresponding path program 115 times [2020-02-10 19:44:59,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358018873] [2020-02-10 19:44:59,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:00,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358018873] [2020-02-10 19:45:00,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:00,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019381304] [2020-02-10 19:45:00,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:00,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:00,312 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:45:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,449 INFO L93 Difference]: Finished difference Result 1372 states and 4843 transitions. [2020-02-10 19:45:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:00,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,452 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:45:00,453 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 19:45:00,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 19:45:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 788. [2020-02-10 19:45:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 19:45:00,475 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 19:45:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,475 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 19:45:00,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 19:45:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:00,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,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] [2020-02-10 19:45:00,477 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash -716858833, now seen corresponding path program 116 times [2020-02-10 19:45:00,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053226206] [2020-02-10 19:45:00,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:00,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053226206] [2020-02-10 19:45:00,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:00,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011476623] [2020-02-10 19:45:00,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:00,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:00,839 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:45:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,975 INFO L93 Difference]: Finished difference Result 1376 states and 4848 transitions. [2020-02-10 19:45:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:00,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,979 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:45:00,979 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 19:45:00,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 19:45:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-02-10 19:45:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:45:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-02-10 19:45:01,007 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-02-10 19:45:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,008 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-02-10 19:45:01,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-02-10 19:45:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:01,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,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] [2020-02-10 19:45:01,010 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 366729651, now seen corresponding path program 117 times [2020-02-10 19:45:01,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482962584] [2020-02-10 19:45:01,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,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 19:45:01,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482962584] [2020-02-10 19:45:01,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:01,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421051583] [2020-02-10 19:45:01,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:01,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:01,485 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:45:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,687 INFO L93 Difference]: Finished difference Result 1370 states and 4836 transitions. [2020-02-10 19:45:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:01,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,693 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 19:45:01,693 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:45:01,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:45:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 19:45:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-02-10 19:45:01,749 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-02-10 19:45:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,749 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-02-10 19:45:01,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-02-10 19:45:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:01,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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] [2020-02-10 19:45:01,753 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash -706355729, now seen corresponding path program 118 times [2020-02-10 19:45:01,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535002350] [2020-02-10 19:45:01,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,248 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-02-10 19:45:02,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 19:45:02,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535002350] [2020-02-10 19:45:02,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:02,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89049500] [2020-02-10 19:45:02,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:02,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:02,259 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:45:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,481 INFO L93 Difference]: Finished difference Result 1372 states and 4837 transitions. [2020-02-10 19:45:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:02,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,487 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 19:45:02,487 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 19:45:02,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 19:45:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-02-10 19:45:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:45:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-02-10 19:45:02,537 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-02-10 19:45:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,538 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-02-10 19:45:02,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-02-10 19:45:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:02,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:02,541 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash 377232755, now seen corresponding path program 119 times [2020-02-10 19:45:02,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67085290] [2020-02-10 19:45:02,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:02,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67085290] [2020-02-10 19:45:02,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:02,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398145039] [2020-02-10 19:45:02,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:02,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:02,941 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:45:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,092 INFO L93 Difference]: Finished difference Result 1380 states and 4855 transitions. [2020-02-10 19:45:03,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:03,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,095 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 19:45:03,095 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:45:03,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:45:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-02-10 19:45:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3138 transitions. [2020-02-10 19:45:03,118 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3138 transitions. Word has length 25 [2020-02-10 19:45:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,118 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3138 transitions. [2020-02-10 19:45:03,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3138 transitions. [2020-02-10 19:45:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:03,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,119 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1988173713, now seen corresponding path program 120 times [2020-02-10 19:45:03,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070137263] [2020-02-10 19:45:03,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:03,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070137263] [2020-02-10 19:45:03,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:03,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703739578] [2020-02-10 19:45:03,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:03,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:03,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:03,506 INFO L87 Difference]: Start difference. First operand 790 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:45:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,645 INFO L93 Difference]: Finished difference Result 1378 states and 4846 transitions. [2020-02-10 19:45:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:03,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,649 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 19:45:03,649 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 19:45:03,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 19:45:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 776. [2020-02-10 19:45:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:45:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3111 transitions. [2020-02-10 19:45:03,671 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3111 transitions. Word has length 25 [2020-02-10 19:45:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,671 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3111 transitions. [2020-02-10 19:45:03,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3111 transitions. [2020-02-10 19:45:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:03,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,673 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1635199863, now seen corresponding path program 121 times [2020-02-10 19:45:03,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903430541] [2020-02-10 19:45:03,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:04,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903430541] [2020-02-10 19:45:04,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:04,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108681113] [2020-02-10 19:45:04,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:04,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:04,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:04,045 INFO L87 Difference]: Start difference. First operand 776 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:45:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,189 INFO L93 Difference]: Finished difference Result 1402 states and 4942 transitions. [2020-02-10 19:45:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:04,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,194 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 19:45:04,194 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:45:04,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:45:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 792. [2020-02-10 19:45:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:45:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3172 transitions. [2020-02-10 19:45:04,218 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3172 transitions. Word has length 25 [2020-02-10 19:45:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,218 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3172 transitions. [2020-02-10 19:45:04,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3172 transitions. [2020-02-10 19:45:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:04,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:04,221 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1689515819, now seen corresponding path program 122 times [2020-02-10 19:45:04,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823820333] [2020-02-10 19:45:04,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:04,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823820333] [2020-02-10 19:45:04,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:04,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540587384] [2020-02-10 19:45:04,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:04,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:04,609 INFO L87 Difference]: Start difference. First operand 792 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:45:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,772 INFO L93 Difference]: Finished difference Result 1404 states and 4942 transitions. [2020-02-10 19:45:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:04,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,776 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 19:45:04,776 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:45:04,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:45:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 19:45:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3162 transitions. [2020-02-10 19:45:04,800 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3162 transitions. Word has length 25 [2020-02-10 19:45:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,800 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3162 transitions. [2020-02-10 19:45:04,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3162 transitions. [2020-02-10 19:45:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:04,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:04,801 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash -733733355, now seen corresponding path program 123 times [2020-02-10 19:45:04,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616532470] [2020-02-10 19:45:04,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:05,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616532470] [2020-02-10 19:45:05,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:05,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232280856] [2020-02-10 19:45:05,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:05,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:05,198 INFO L87 Difference]: Start difference. First operand 788 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:45:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,363 INFO L93 Difference]: Finished difference Result 1398 states and 4930 transitions. [2020-02-10 19:45:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:05,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,367 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 19:45:05,367 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:45:05,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:45:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 791. [2020-02-10 19:45:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3167 transitions. [2020-02-10 19:45:05,390 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3167 transitions. Word has length 25 [2020-02-10 19:45:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,390 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3167 transitions. [2020-02-10 19:45:05,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3167 transitions. [2020-02-10 19:45:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:05,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,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] [2020-02-10 19:45:05,392 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash 247021363, now seen corresponding path program 124 times [2020-02-10 19:45:05,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493458576] [2020-02-10 19:45:05,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,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 19:45:05,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493458576] [2020-02-10 19:45:05,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:05,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126635789] [2020-02-10 19:45:05,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:05,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:05,851 INFO L87 Difference]: Start difference. First operand 791 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:45:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,018 INFO L93 Difference]: Finished difference Result 1397 states and 4925 transitions. [2020-02-10 19:45:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:06,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,022 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 19:45:06,022 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 19:45:06,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 19:45:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-02-10 19:45:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3159 transitions. [2020-02-10 19:45:06,046 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3159 transitions. Word has length 25 [2020-02-10 19:45:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,046 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3159 transitions. [2020-02-10 19:45:06,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3159 transitions. [2020-02-10 19:45:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:06,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:06,048 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1350890633, now seen corresponding path program 125 times [2020-02-10 19:45:06,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077459214] [2020-02-10 19:45:06,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,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 19:45:06,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077459214] [2020-02-10 19:45:06,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:06,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114215252] [2020-02-10 19:45:06,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:06,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:06,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:06,430 INFO L87 Difference]: Start difference. First operand 788 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:45:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,584 INFO L93 Difference]: Finished difference Result 1402 states and 4935 transitions. [2020-02-10 19:45:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:06,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,587 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 19:45:06,587 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 19:45:06,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 19:45:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 791. [2020-02-10 19:45:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-02-10 19:45:06,612 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-02-10 19:45:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,612 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-02-10 19:45:06,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-02-10 19:45:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:06,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:06,614 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash 260050325, now seen corresponding path program 126 times [2020-02-10 19:45:06,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125634708] [2020-02-10 19:45:06,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,082 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2020-02-10 19:45:07,213 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 19:45:07,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 19:45:07,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125634708] [2020-02-10 19:45:07,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:07,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697769185] [2020-02-10 19:45:07,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:07,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:07,226 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:45:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,430 INFO L93 Difference]: Finished difference Result 1399 states and 4926 transitions. [2020-02-10 19:45:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:07,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,435 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:45:07,436 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 19:45:07,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 19:45:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 785. [2020-02-10 19:45:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:45:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3151 transitions. [2020-02-10 19:45:07,492 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3151 transitions. Word has length 25 [2020-02-10 19:45:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,493 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3151 transitions. [2020-02-10 19:45:07,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3151 transitions. [2020-02-10 19:45:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:07,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:07,496 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1212714137, now seen corresponding path program 127 times [2020-02-10 19:45:07,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357418429] [2020-02-10 19:45:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,083 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 19:45:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:08,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357418429] [2020-02-10 19:45:08,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:08,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346320520] [2020-02-10 19:45:08,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:08,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:08,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:08,096 INFO L87 Difference]: Start difference. First operand 785 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:45:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,336 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-02-10 19:45:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:08,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,342 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:45:08,342 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:45:08,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:45:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 19:45:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-02-10 19:45:08,399 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-02-10 19:45:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,399 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-02-10 19:45:08,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-02-10 19:45:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:08,402 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:08,405 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2112001545, now seen corresponding path program 128 times [2020-02-10 19:45:08,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187660819] [2020-02-10 19:45:08,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,826 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 19:45:08,965 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 19:45:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:08,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187660819] [2020-02-10 19:45:08,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299297361] [2020-02-10 19:45:08,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:08,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:08,972 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-02-10 19:45:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,117 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-02-10 19:45:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:09,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,121 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:45:09,121 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:45:09,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:45:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 19:45:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3162 transitions. [2020-02-10 19:45:09,157 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3162 transitions. Word has length 25 [2020-02-10 19:45:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,158 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3162 transitions. [2020-02-10 19:45:09,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3162 transitions. [2020-02-10 19:45:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:09,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,160 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash 769814997, now seen corresponding path program 129 times [2020-02-10 19:45:09,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466029367] [2020-02-10 19:45:09,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:09,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466029367] [2020-02-10 19:45:09,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:09,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251587268] [2020-02-10 19:45:09,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:09,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:09,541 INFO L87 Difference]: Start difference. First operand 789 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:45:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,686 INFO L93 Difference]: Finished difference Result 1412 states and 4961 transitions. [2020-02-10 19:45:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:09,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,690 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:45:09,690 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:45:09,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:45:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 793. [2020-02-10 19:45:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-02-10 19:45:09,712 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-02-10 19:45:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,713 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-02-10 19:45:09,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-02-10 19:45:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:09,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,714 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1761072819, now seen corresponding path program 130 times [2020-02-10 19:45:09,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094043861] [2020-02-10 19:45:09,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,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 19:45:10,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094043861] [2020-02-10 19:45:10,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:10,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421316755] [2020-02-10 19:45:10,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:10,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:10,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:10,113 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:45:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,299 INFO L93 Difference]: Finished difference Result 1415 states and 4963 transitions. [2020-02-10 19:45:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:10,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,303 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 19:45:10,303 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 19:45:10,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 19:45:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 789. [2020-02-10 19:45:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3158 transitions. [2020-02-10 19:45:10,330 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3158 transitions. Word has length 25 [2020-02-10 19:45:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,330 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3158 transitions. [2020-02-10 19:45:10,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3158 transitions. [2020-02-10 19:45:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:10,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:10,332 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1447780135, now seen corresponding path program 131 times [2020-02-10 19:45:10,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012056409] [2020-02-10 19:45:10,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,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 19:45:10,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012056409] [2020-02-10 19:45:10,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:10,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717729759] [2020-02-10 19:45:10,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:10,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:10,737 INFO L87 Difference]: Start difference. First operand 789 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:45:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,882 INFO L93 Difference]: Finished difference Result 1418 states and 4971 transitions. [2020-02-10 19:45:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:10,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,887 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:45:10,887 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:45:10,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:45:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 795. [2020-02-10 19:45:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3169 transitions. [2020-02-10 19:45:10,910 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3169 transitions. Word has length 25 [2020-02-10 19:45:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,910 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3169 transitions. [2020-02-10 19:45:10,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3169 transitions. [2020-02-10 19:45:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:10,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,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] [2020-02-10 19:45:10,911 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1774101781, now seen corresponding path program 132 times [2020-02-10 19:45:10,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564737469] [2020-02-10 19:45:10,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:11,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564737469] [2020-02-10 19:45:11,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:11,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11863566] [2020-02-10 19:45:11,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:11,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:11,293 INFO L87 Difference]: Start difference. First operand 795 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:45:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,481 INFO L93 Difference]: Finished difference Result 1419 states and 4967 transitions. [2020-02-10 19:45:11,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:11,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,485 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:45:11,485 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:45:11,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:45:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 785. [2020-02-10 19:45:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:45:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3148 transitions. [2020-02-10 19:45:11,507 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3148 transitions. Word has length 25 [2020-02-10 19:45:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,507 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3148 transitions. [2020-02-10 19:45:11,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3148 transitions. [2020-02-10 19:45:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:11,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:11,509 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1578704807, now seen corresponding path program 133 times [2020-02-10 19:45:11,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897560127] [2020-02-10 19:45:11,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:11,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897560127] [2020-02-10 19:45:11,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:11,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545104136] [2020-02-10 19:45:11,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:11,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:11,902 INFO L87 Difference]: Start difference. First operand 785 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:45:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,083 INFO L93 Difference]: Finished difference Result 1399 states and 4929 transitions. [2020-02-10 19:45:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:12,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,087 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:45:12,087 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 19:45:12,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 19:45:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 791. [2020-02-10 19:45:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-02-10 19:45:12,112 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-02-10 19:45:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,112 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-02-10 19:45:12,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-02-10 19:45:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:12,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,113 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash -597950089, now seen corresponding path program 134 times [2020-02-10 19:45:12,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501836625] [2020-02-10 19:45:12,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,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 19:45:12,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501836625] [2020-02-10 19:45:12,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:12,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312794735] [2020-02-10 19:45:12,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:12,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:12,509 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:45:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,698 INFO L93 Difference]: Finished difference Result 1398 states and 4924 transitions. [2020-02-10 19:45:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:12,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,703 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 19:45:12,703 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:45:12,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:45:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 19:45:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3156 transitions. [2020-02-10 19:45:12,728 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3156 transitions. Word has length 25 [2020-02-10 19:45:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,728 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3156 transitions. [2020-02-10 19:45:12,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3156 transitions. [2020-02-10 19:45:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:12,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,729 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 347329271, now seen corresponding path program 135 times [2020-02-10 19:45:12,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8424169] [2020-02-10 19:45:12,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:13,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8424169] [2020-02-10 19:45:13,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:13,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352615154] [2020-02-10 19:45:13,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:13,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:13,205 INFO L87 Difference]: Start difference. First operand 788 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:45:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,349 INFO L93 Difference]: Finished difference Result 1404 states and 4937 transitions. [2020-02-10 19:45:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:13,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,353 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 19:45:13,353 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 19:45:13,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 19:45:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 792. [2020-02-10 19:45:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:45:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3163 transitions. [2020-02-10 19:45:13,387 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3163 transitions. Word has length 25 [2020-02-10 19:45:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,388 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3163 transitions. [2020-02-10 19:45:13,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3163 transitions. [2020-02-10 19:45:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:13,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:13,390 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1338587093, now seen corresponding path program 136 times [2020-02-10 19:45:13,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261633963] [2020-02-10 19:45:13,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:13,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261633963] [2020-02-10 19:45:13,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:13,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678196519] [2020-02-10 19:45:13,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:13,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:13,800 INFO L87 Difference]: Start difference. First operand 792 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:45:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,032 INFO L93 Difference]: Finished difference Result 1407 states and 4939 transitions. [2020-02-10 19:45:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:14,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,036 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:45:14,036 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 19:45:14,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 19:45:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 788. [2020-02-10 19:45:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-02-10 19:45:14,074 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-02-10 19:45:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,075 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-02-10 19:45:14,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-02-10 19:45:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:14,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,077 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 66271321, now seen corresponding path program 137 times [2020-02-10 19:45:14,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883587779] [2020-02-10 19:45:14,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:14,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883587779] [2020-02-10 19:45:14,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:14,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61432019] [2020-02-10 19:45:14,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:14,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:14,472 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:45:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,661 INFO L93 Difference]: Finished difference Result 1401 states and 4927 transitions. [2020-02-10 19:45:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:14,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,665 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 19:45:14,665 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:45:14,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:45:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-02-10 19:45:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 19:45:14,688 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 19:45:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,688 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 19:45:14,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 19:45:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:14,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,689 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1677212279, now seen corresponding path program 138 times [2020-02-10 19:45:14,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631517124] [2020-02-10 19:45:14,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:15,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631517124] [2020-02-10 19:45:15,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:15,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547978585] [2020-02-10 19:45:15,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:15,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:15,130 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:45:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,284 INFO L93 Difference]: Finished difference Result 1405 states and 4932 transitions. [2020-02-10 19:45:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:15,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,288 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 19:45:15,289 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:45:15,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:45:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 785. [2020-02-10 19:45:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:45:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3145 transitions. [2020-02-10 19:45:15,312 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3145 transitions. Word has length 25 [2020-02-10 19:45:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,312 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3145 transitions. [2020-02-10 19:45:15,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3145 transitions. [2020-02-10 19:45:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:15,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:15,314 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2060103893, now seen corresponding path program 139 times [2020-02-10 19:45:15,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126536636] [2020-02-10 19:45:15,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:15,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126536636] [2020-02-10 19:45:15,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:15,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658265267] [2020-02-10 19:45:15,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:15,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:15,720 INFO L87 Difference]: Start difference. First operand 785 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:45:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,898 INFO L93 Difference]: Finished difference Result 1407 states and 4944 transitions. [2020-02-10 19:45:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:15,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,912 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:45:15,912 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 19:45:15,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 19:45:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-02-10 19:45:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-02-10 19:45:15,934 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-02-10 19:45:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,935 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-02-10 19:45:15,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-02-10 19:45:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:15,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:15,936 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,936 INFO L82 PathProgramCache]: Analyzing trace with hash -623922445, now seen corresponding path program 140 times [2020-02-10 19:45:15,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902423284] [2020-02-10 19:45:15,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:16,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902423284] [2020-02-10 19:45:16,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:16,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422494631] [2020-02-10 19:45:16,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:16,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:16,317 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:45:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,483 INFO L93 Difference]: Finished difference Result 1404 states and 4935 transitions. [2020-02-10 19:45:16,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:16,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,487 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 19:45:16,487 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:45:16,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:45:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-02-10 19:45:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-02-10 19:45:16,510 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-02-10 19:45:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,510 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-02-10 19:45:16,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-02-10 19:45:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:16,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:16,511 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash 459666039, now seen corresponding path program 141 times [2020-02-10 19:45:16,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353142673] [2020-02-10 19:45:16,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:16,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353142673] [2020-02-10 19:45:16,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:16,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299907394] [2020-02-10 19:45:16,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:16,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:16,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:16,888 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:45:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,053 INFO L93 Difference]: Finished difference Result 1414 states and 4958 transitions. [2020-02-10 19:45:17,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:17,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,057 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:45:17,057 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:45:17,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:45:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-02-10 19:45:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 19:45:17,081 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 19:45:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,081 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 19:45:17,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 19:45:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:17,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:17,082 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash -613419341, now seen corresponding path program 142 times [2020-02-10 19:45:17,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538481179] [2020-02-10 19:45:17,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:17,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538481179] [2020-02-10 19:45:17,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:17,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336274198] [2020-02-10 19:45:17,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:17,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:17,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:17,486 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:45:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,669 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-02-10 19:45:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:17,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,673 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 19:45:17,673 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:45:17,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:45:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 788. [2020-02-10 19:45:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:45:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3150 transitions. [2020-02-10 19:45:17,695 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3150 transitions. Word has length 25 [2020-02-10 19:45:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,695 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3150 transitions. [2020-02-10 19:45:17,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3150 transitions. [2020-02-10 19:45:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:17,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:17,697 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash 470169143, now seen corresponding path program 143 times [2020-02-10 19:45:17,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224980201] [2020-02-10 19:45:17,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:18,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224980201] [2020-02-10 19:45:18,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:18,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337282707] [2020-02-10 19:45:18,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:18,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:18,075 INFO L87 Difference]: Start difference. First operand 788 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:45:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,261 INFO L93 Difference]: Finished difference Result 1405 states and 4934 transitions. [2020-02-10 19:45:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:18,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,265 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 19:45:18,265 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:45:18,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:45:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 791. [2020-02-10 19:45:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 19:45:18,288 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 19:45:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,288 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 19:45:18,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 19:45:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:18,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,290 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2081110101, now seen corresponding path program 144 times [2020-02-10 19:45:18,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42646110] [2020-02-10 19:45:18,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:18,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42646110] [2020-02-10 19:45:18,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:18,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795815737] [2020-02-10 19:45:18,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:18,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:18,679 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:45:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,867 INFO L93 Difference]: Finished difference Result 1409 states and 4939 transitions. [2020-02-10 19:45:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:18,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,871 INFO L225 Difference]: With dead ends: 1409 [2020-02-10 19:45:18,871 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 19:45:18,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 19:45:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 782. [2020-02-10 19:45:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:45:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3137 transitions. [2020-02-10 19:45:18,893 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3137 transitions. Word has length 25 [2020-02-10 19:45:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,893 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3137 transitions. [2020-02-10 19:45:18,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3137 transitions. [2020-02-10 19:45:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:18,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,894 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1210888627, now seen corresponding path program 145 times [2020-02-10 19:45:18,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294331408] [2020-02-10 19:45:18,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:19,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294331408] [2020-02-10 19:45:19,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:19,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845263895] [2020-02-10 19:45:19,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:19,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:19,267 INFO L87 Difference]: Start difference. First operand 782 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:45:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,452 INFO L93 Difference]: Finished difference Result 1411 states and 4961 transitions. [2020-02-10 19:45:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:19,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,456 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:45:19,456 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:45:19,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:45:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 19:45:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-02-10 19:45:19,479 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-02-10 19:45:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,479 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-02-10 19:45:19,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-02-10 19:45:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:19,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,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] [2020-02-10 19:45:19,480 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2113827055, now seen corresponding path program 146 times [2020-02-10 19:45:19,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971692911] [2020-02-10 19:45:19,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,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 19:45:19,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971692911] [2020-02-10 19:45:19,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:19,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805826483] [2020-02-10 19:45:19,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:19,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:19,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:19,878 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-02-10 19:45:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,063 INFO L93 Difference]: Finished difference Result 1413 states and 4961 transitions. [2020-02-10 19:45:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:20,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,067 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:45:20,067 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:45:20,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:45:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 19:45:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-02-10 19:45:20,090 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-02-10 19:45:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,090 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-02-10 19:45:20,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-02-10 19:45:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:20,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,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] [2020-02-10 19:45:20,092 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1158044591, now seen corresponding path program 147 times [2020-02-10 19:45:20,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615399045] [2020-02-10 19:45:20,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,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 19:45:20,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615399045] [2020-02-10 19:45:20,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:20,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678983857] [2020-02-10 19:45:20,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:20,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:20,469 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:45:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,611 INFO L93 Difference]: Finished difference Result 1407 states and 4949 transitions. [2020-02-10 19:45:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:20,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,615 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:45:20,615 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:45:20,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:45:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-02-10 19:45:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:45:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3168 transitions. [2020-02-10 19:45:20,638 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,638 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3168 transitions. [2020-02-10 19:45:20,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3168 transitions. [2020-02-10 19:45:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:20,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,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] [2020-02-10 19:45:20,639 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -177289873, now seen corresponding path program 148 times [2020-02-10 19:45:20,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789893434] [2020-02-10 19:45:20,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:21,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789893434] [2020-02-10 19:45:21,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:21,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635733753] [2020-02-10 19:45:21,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:21,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:21,024 INFO L87 Difference]: Start difference. First operand 792 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,217 INFO L93 Difference]: Finished difference Result 1406 states and 4944 transitions. [2020-02-10 19:45:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:21,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,221 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:45:21,221 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 19:45:21,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 19:45:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 789. [2020-02-10 19:45:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-02-10 19:45:21,244 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-02-10 19:45:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,245 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-02-10 19:45:21,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-02-10 19:45:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:21,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:21,246 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1775201869, now seen corresponding path program 149 times [2020-02-10 19:45:21,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980082816] [2020-02-10 19:45:21,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:21,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980082816] [2020-02-10 19:45:21,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:21,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197440856] [2020-02-10 19:45:21,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:21,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:21,637 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:45:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,785 INFO L93 Difference]: Finished difference Result 1411 states and 4954 transitions. [2020-02-10 19:45:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:21,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,789 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:45:21,789 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:45:21,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:45:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 19:45:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:45:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3165 transitions. [2020-02-10 19:45:21,812 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3165 transitions. Word has length 25 [2020-02-10 19:45:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,812 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3165 transitions. [2020-02-10 19:45:21,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3165 transitions. [2020-02-10 19:45:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:21,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:21,813 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash -164260911, now seen corresponding path program 150 times [2020-02-10 19:45:21,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652187935] [2020-02-10 19:45:21,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652187935] [2020-02-10 19:45:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:22,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506753091] [2020-02-10 19:45:22,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:22,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:22,195 INFO L87 Difference]: Start difference. First operand 792 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:45:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,363 INFO L93 Difference]: Finished difference Result 1408 states and 4945 transitions. [2020-02-10 19:45:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:22,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,367 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 19:45:22,368 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:45:22,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:45:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-02-10 19:45:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:45:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3152 transitions. [2020-02-10 19:45:22,391 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3152 transitions. Word has length 25 [2020-02-10 19:45:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,391 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3152 transitions. [2020-02-10 19:45:22,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3152 transitions. [2020-02-10 19:45:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:22,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,392 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash -56568551, now seen corresponding path program 151 times [2020-02-10 19:45:22,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499615251] [2020-02-10 19:45:22,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:22,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499615251] [2020-02-10 19:45:22,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:22,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288375350] [2020-02-10 19:45:22,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:22,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:22,764 INFO L87 Difference]: Start difference. First operand 786 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:45:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,931 INFO L93 Difference]: Finished difference Result 1425 states and 4992 transitions. [2020-02-10 19:45:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:22,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,934 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 19:45:22,934 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:45:22,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:45:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 19:45:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3177 transitions. [2020-02-10 19:45:22,957 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3177 transitions. Word has length 25 [2020-02-10 19:45:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,957 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3177 transitions. [2020-02-10 19:45:22,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3177 transitions. [2020-02-10 19:45:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:22,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,959 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash 913683063, now seen corresponding path program 152 times [2020-02-10 19:45:22,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815420816] [2020-02-10 19:45:22,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:23,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815420816] [2020-02-10 19:45:23,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:23,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955006551] [2020-02-10 19:45:23,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:23,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:23,334 INFO L87 Difference]: Start difference. First operand 795 states and 3177 transitions. Second operand 10 states. [2020-02-10 19:45:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,482 INFO L93 Difference]: Finished difference Result 1427 states and 4992 transitions. [2020-02-10 19:45:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:23,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,486 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 19:45:23,486 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 19:45:23,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 19:45:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-02-10 19:45:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-02-10 19:45:23,509 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-02-10 19:45:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,509 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-02-10 19:45:23,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-02-10 19:45:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:23,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:23,511 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash -942366831, now seen corresponding path program 153 times [2020-02-10 19:45:23,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635108513] [2020-02-10 19:45:23,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:23,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635108513] [2020-02-10 19:45:23,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:23,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340711650] [2020-02-10 19:45:23,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:23,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:23,886 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-02-10 19:45:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,044 INFO L93 Difference]: Finished difference Result 1429 states and 4995 transitions. [2020-02-10 19:45:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:24,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,048 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:45:24,048 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:45:24,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:45:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 796. [2020-02-10 19:45:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:45:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3175 transitions. [2020-02-10 19:45:24,071 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3175 transitions. Word has length 25 [2020-02-10 19:45:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,071 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3175 transitions. [2020-02-10 19:45:24,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3175 transitions. [2020-02-10 19:45:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:24,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,073 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 69897199, now seen corresponding path program 154 times [2020-02-10 19:45:24,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394064707] [2020-02-10 19:45:24,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,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 19:45:24,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394064707] [2020-02-10 19:45:24,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:24,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113879019] [2020-02-10 19:45:24,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:24,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:24,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:24,485 INFO L87 Difference]: Start difference. First operand 796 states and 3175 transitions. Second operand 10 states. [2020-02-10 19:45:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,598 INFO L93 Difference]: Finished difference Result 1434 states and 5000 transitions. [2020-02-10 19:45:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:24,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,602 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:45:24,602 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 19:45:24,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 19:45:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-02-10 19:45:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-02-10 19:45:24,626 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-02-10 19:45:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,626 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-02-10 19:45:24,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-02-10 19:45:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:24,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:24,627 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2065870375, now seen corresponding path program 155 times [2020-02-10 19:45:24,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026048462] [2020-02-10 19:45:24,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,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 19:45:25,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026048462] [2020-02-10 19:45:25,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:25,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043914398] [2020-02-10 19:45:25,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:25,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:25,008 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:45:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,139 INFO L93 Difference]: Finished difference Result 1435 states and 5004 transitions. [2020-02-10 19:45:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:25,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,142 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 19:45:25,142 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 19:45:25,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 19:45:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 798. [2020-02-10 19:45:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:45:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3174 transitions. [2020-02-10 19:45:25,165 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3174 transitions. Word has length 25 [2020-02-10 19:45:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,165 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3174 transitions. [2020-02-10 19:45:25,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3174 transitions. [2020-02-10 19:45:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:25,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:25,167 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash 82926161, now seen corresponding path program 156 times [2020-02-10 19:45:25,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550118394] [2020-02-10 19:45:25,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:25,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550118394] [2020-02-10 19:45:25,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:25,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462895315] [2020-02-10 19:45:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:25,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:25,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:25,576 INFO L87 Difference]: Start difference. First operand 798 states and 3174 transitions. Second operand 10 states. [2020-02-10 19:45:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,707 INFO L93 Difference]: Finished difference Result 1438 states and 5003 transitions. [2020-02-10 19:45:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:25,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,712 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 19:45:25,712 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 19:45:25,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 19:45:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 786. [2020-02-10 19:45:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:45:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3148 transitions. [2020-02-10 19:45:25,736 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3148 transitions. Word has length 25 [2020-02-10 19:45:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,736 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3148 transitions. [2020-02-10 19:45:25,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3148 transitions. [2020-02-10 19:45:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:25,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:25,737 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1446979801, now seen corresponding path program 157 times [2020-02-10 19:45:25,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207470021] [2020-02-10 19:45:25,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:26,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207470021] [2020-02-10 19:45:26,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:26,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925858805] [2020-02-10 19:45:26,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:26,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:26,127 INFO L87 Difference]: Start difference. First operand 786 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:45:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,257 INFO L93 Difference]: Finished difference Result 1413 states and 4957 transitions. [2020-02-10 19:45:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:26,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,260 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:45:26,260 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 19:45:26,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 19:45:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 793. [2020-02-10 19:45:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3167 transitions. [2020-02-10 19:45:26,284 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3167 transitions. Word has length 25 [2020-02-10 19:45:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,284 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3167 transitions. [2020-02-10 19:45:26,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3167 transitions. [2020-02-10 19:45:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:26,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:26,285 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1867232777, now seen corresponding path program 158 times [2020-02-10 19:45:26,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632119803] [2020-02-10 19:45:26,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:26,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632119803] [2020-02-10 19:45:26,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:26,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894464043] [2020-02-10 19:45:26,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:26,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:26,694 INFO L87 Difference]: Start difference. First operand 793 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:45:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,839 INFO L93 Difference]: Finished difference Result 1412 states and 4952 transitions. [2020-02-10 19:45:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:26,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,843 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:45:26,843 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 19:45:26,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 19:45:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 790. [2020-02-10 19:45:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-02-10 19:45:26,866 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-02-10 19:45:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,866 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-02-10 19:45:26,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-02-10 19:45:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:26,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:26,868 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1364852557, now seen corresponding path program 159 times [2020-02-10 19:45:26,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461006114] [2020-02-10 19:45:26,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:27,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461006114] [2020-02-10 19:45:27,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:27,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405317513] [2020-02-10 19:45:27,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:27,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:27,276 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:45:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,409 INFO L93 Difference]: Finished difference Result 1421 states and 4970 transitions. [2020-02-10 19:45:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:27,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,413 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:45:27,413 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 19:45:27,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 19:45:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-02-10 19:45:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-02-10 19:45:27,435 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,435 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-02-10 19:45:27,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-02-10 19:45:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:27,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,437 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash -352588527, now seen corresponding path program 160 times [2020-02-10 19:45:27,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755716639] [2020-02-10 19:45:27,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:27,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755716639] [2020-02-10 19:45:27,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:27,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313535410] [2020-02-10 19:45:27,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:27,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:27,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:27,828 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,936 INFO L93 Difference]: Finished difference Result 1426 states and 4975 transitions. [2020-02-10 19:45:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:27,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,940 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 19:45:27,940 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:45:27,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:45:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 19:45:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 19:45:27,963 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 19:45:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,964 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 19:45:27,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 19:45:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:27,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:27,965 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -551818919, now seen corresponding path program 161 times [2020-02-10 19:45:27,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291764759] [2020-02-10 19:45:27,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,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 19:45:28,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291764759] [2020-02-10 19:45:28,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:28,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600608845] [2020-02-10 19:45:28,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:28,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:28,352 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:45:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,484 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-02-10 19:45:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:28,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,488 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:45:28,488 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:45:28,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:45:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 19:45:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 19:45:28,512 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 19:45:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,512 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 19:45:28,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 19:45:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:28,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:28,513 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash -13963341, now seen corresponding path program 162 times [2020-02-10 19:45:28,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143085227] [2020-02-10 19:45:28,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:28,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143085227] [2020-02-10 19:45:28,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:28,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317447582] [2020-02-10 19:45:28,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:28,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:28,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:28,895 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:45:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,027 INFO L93 Difference]: Finished difference Result 1424 states and 4967 transitions. [2020-02-10 19:45:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:29,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,031 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:45:29,031 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:45:29,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:45:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-02-10 19:45:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:45:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3144 transitions. [2020-02-10 19:45:29,055 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3144 transitions. Word has length 25 [2020-02-10 19:45:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,055 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3144 transitions. [2020-02-10 19:45:29,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3144 transitions. [2020-02-10 19:45:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:29,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,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] [2020-02-10 19:45:29,057 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 347922065, now seen corresponding path program 163 times [2020-02-10 19:45:29,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59799236] [2020-02-10 19:45:29,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:29,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59799236] [2020-02-10 19:45:29,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:29,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328401276] [2020-02-10 19:45:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:29,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:29,435 INFO L87 Difference]: Start difference. First operand 786 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:45:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,584 INFO L93 Difference]: Finished difference Result 1421 states and 4971 transitions. [2020-02-10 19:45:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:29,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,588 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:45:29,588 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:45:29,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:45:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 793. [2020-02-10 19:45:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3163 transitions. [2020-02-10 19:45:29,612 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3163 transitions. Word has length 25 [2020-02-10 19:45:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,612 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3163 transitions. [2020-02-10 19:45:29,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3163 transitions. [2020-02-10 19:45:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:29,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:29,613 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:29,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1958863023, now seen corresponding path program 164 times [2020-02-10 19:45:29,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254705615] [2020-02-10 19:45:29,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:29,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254705615] [2020-02-10 19:45:29,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:29,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384109892] [2020-02-10 19:45:29,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:29,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:29,995 INFO L87 Difference]: Start difference. First operand 793 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:45:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,126 INFO L93 Difference]: Finished difference Result 1418 states and 4962 transitions. [2020-02-10 19:45:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:30,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,131 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:45:30,131 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:45:30,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:45:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 19:45:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 19:45:30,154 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 19:45:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,154 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 19:45:30,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 19:45:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:30,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:30,155 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash -158424201, now seen corresponding path program 165 times [2020-02-10 19:45:30,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451657046] [2020-02-10 19:45:30,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:30,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451657046] [2020-02-10 19:45:30,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:30,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667973348] [2020-02-10 19:45:30,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:30,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:30,657 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:45:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,771 INFO L93 Difference]: Finished difference Result 1431 states and 4990 transitions. [2020-02-10 19:45:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:30,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,774 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 19:45:30,774 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:45:30,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:45:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-02-10 19:45:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:45:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 19:45:30,797 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,797 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 19:45:30,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 19:45:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:30,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:30,799 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1990372335, now seen corresponding path program 166 times [2020-02-10 19:45:30,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670695150] [2020-02-10 19:45:30,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:31,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670695150] [2020-02-10 19:45:31,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:31,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920096830] [2020-02-10 19:45:31,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:31,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:31,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:31,198 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,303 INFO L93 Difference]: Finished difference Result 1434 states and 4989 transitions. [2020-02-10 19:45:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:31,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,307 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:45:31,307 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:45:31,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:45:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-02-10 19:45:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3151 transitions. [2020-02-10 19:45:31,330 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3151 transitions. Word has length 25 [2020-02-10 19:45:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,330 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3151 transitions. [2020-02-10 19:45:31,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3151 transitions. [2020-02-10 19:45:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:31,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:31,331 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash -147921097, now seen corresponding path program 167 times [2020-02-10 19:45:31,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249545977] [2020-02-10 19:45:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,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 19:45:31,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249545977] [2020-02-10 19:45:31,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:31,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733011800] [2020-02-10 19:45:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:31,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:31,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:31,728 INFO L87 Difference]: Start difference. First operand 790 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:45:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,857 INFO L93 Difference]: Finished difference Result 1422 states and 4965 transitions. [2020-02-10 19:45:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:31,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,861 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:45:31,861 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:45:31,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:45:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-02-10 19:45:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-02-10 19:45:31,884 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-02-10 19:45:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,884 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-02-10 19:45:31,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-02-10 19:45:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:31,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,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] [2020-02-10 19:45:31,886 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash 389934481, now seen corresponding path program 168 times [2020-02-10 19:45:31,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130624516] [2020-02-10 19:45:31,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,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 19:45:32,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130624516] [2020-02-10 19:45:32,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:32,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466277790] [2020-02-10 19:45:32,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:32,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:32,273 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:45:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,378 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 19:45:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:32,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,382 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:45:32,382 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:45:32,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:45:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 782. [2020-02-10 19:45:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:45:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 19:45:32,405 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 19:45:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,405 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 19:45:32,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 19:45:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:32,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:32,406 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 576247283, now seen corresponding path program 169 times [2020-02-10 19:45:32,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710459502] [2020-02-10 19:45:32,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,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 19:45:32,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710459502] [2020-02-10 19:45:32,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:32,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608279769] [2020-02-10 19:45:32,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:32,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:32,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:32,785 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:45:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:32,920 INFO L93 Difference]: Finished difference Result 1444 states and 5049 transitions. [2020-02-10 19:45:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:32,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:32,924 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:45:32,924 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 19:45:32,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 19:45:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 797. [2020-02-10 19:45:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:45:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3183 transitions. [2020-02-10 19:45:32,947 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3183 transitions. Word has length 25 [2020-02-10 19:45:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:32,948 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3183 transitions. [2020-02-10 19:45:32,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3183 transitions. [2020-02-10 19:45:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:32,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:32,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:32,949 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1546498897, now seen corresponding path program 170 times [2020-02-10 19:45:32,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:32,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218129437] [2020-02-10 19:45:32,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:33,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218129437] [2020-02-10 19:45:33,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:33,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829365442] [2020-02-10 19:45:33,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:33,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:33,332 INFO L87 Difference]: Start difference. First operand 797 states and 3183 transitions. Second operand 10 states. [2020-02-10 19:45:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,486 INFO L93 Difference]: Finished difference Result 1446 states and 5049 transitions. [2020-02-10 19:45:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:33,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,491 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:45:33,491 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 19:45:33,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 19:45:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-02-10 19:45:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3172 transitions. [2020-02-10 19:45:33,514 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3172 transitions. Word has length 25 [2020-02-10 19:45:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,514 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3172 transitions. [2020-02-10 19:45:33,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3172 transitions. [2020-02-10 19:45:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:33,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,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] [2020-02-10 19:45:33,515 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 133348143, now seen corresponding path program 171 times [2020-02-10 19:45:33,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919360496] [2020-02-10 19:45:33,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:33,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919360496] [2020-02-10 19:45:33,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:33,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594286592] [2020-02-10 19:45:33,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:33,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:33,896 INFO L87 Difference]: Start difference. First operand 793 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:45:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,022 INFO L93 Difference]: Finished difference Result 1445 states and 5047 transitions. [2020-02-10 19:45:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:34,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,025 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 19:45:34,026 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:45:34,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:45:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 797. [2020-02-10 19:45:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:45:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3179 transitions. [2020-02-10 19:45:34,048 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3179 transitions. Word has length 25 [2020-02-10 19:45:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,049 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3179 transitions. [2020-02-10 19:45:34,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3179 transitions. [2020-02-10 19:45:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:34,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,050 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1124605965, now seen corresponding path program 172 times [2020-02-10 19:45:34,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727768290] [2020-02-10 19:45:34,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,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 19:45:34,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727768290] [2020-02-10 19:45:34,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:34,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149776043] [2020-02-10 19:45:34,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:34,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:34,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:34,431 INFO L87 Difference]: Start difference. First operand 797 states and 3179 transitions. Second operand 10 states. [2020-02-10 19:45:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,564 INFO L93 Difference]: Finished difference Result 1448 states and 5049 transitions. [2020-02-10 19:45:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:34,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,568 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 19:45:34,568 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:45:34,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:45:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-02-10 19:45:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3168 transitions. [2020-02-10 19:45:34,591 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,592 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3168 transitions. [2020-02-10 19:45:34,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3168 transitions. [2020-02-10 19:45:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:34,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,593 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2084246989, now seen corresponding path program 173 times [2020-02-10 19:45:34,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140959600] [2020-02-10 19:45:34,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:34,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140959600] [2020-02-10 19:45:34,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:34,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678297121] [2020-02-10 19:45:34,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:34,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:34,989 INFO L87 Difference]: Start difference. First operand 793 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,114 INFO L93 Difference]: Finished difference Result 1451 states and 5057 transitions. [2020-02-10 19:45:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:35,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,118 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 19:45:35,119 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:45:35,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:45:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-02-10 19:45:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:45:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-02-10 19:45:35,142 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-02-10 19:45:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,142 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-02-10 19:45:35,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-02-10 19:45:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:35,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,144 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1137634927, now seen corresponding path program 174 times [2020-02-10 19:45:35,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128957211] [2020-02-10 19:45:35,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:35,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128957211] [2020-02-10 19:45:35,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:35,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357353793] [2020-02-10 19:45:35,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:35,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:35,517 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-02-10 19:45:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,649 INFO L93 Difference]: Finished difference Result 1452 states and 5053 transitions. [2020-02-10 19:45:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:35,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,653 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 19:45:35,653 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 19:45:35,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 19:45:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 789. [2020-02-10 19:45:35,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3157 transitions. [2020-02-10 19:45:35,676 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3157 transitions. Word has length 25 [2020-02-10 19:45:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,676 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3157 transitions. [2020-02-10 19:45:35,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3157 transitions. [2020-02-10 19:45:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:35,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:35,678 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash -268724169, now seen corresponding path program 175 times [2020-02-10 19:45:35,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540393380] [2020-02-10 19:45:35,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,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 19:45:36,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540393380] [2020-02-10 19:45:36,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:36,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509412256] [2020-02-10 19:45:36,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:36,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:36,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:36,053 INFO L87 Difference]: Start difference. First operand 789 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:45:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,190 INFO L93 Difference]: Finished difference Result 1449 states and 5055 transitions. [2020-02-10 19:45:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:36,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,194 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:45:36,194 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:45:36,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:45:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-02-10 19:45:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:45:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3182 transitions. [2020-02-10 19:45:36,218 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3182 transitions. Word has length 25 [2020-02-10 19:45:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,218 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3182 transitions. [2020-02-10 19:45:36,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3182 transitions. [2020-02-10 19:45:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:36,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:36,220 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash 701527445, now seen corresponding path program 176 times [2020-02-10 19:45:36,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495768762] [2020-02-10 19:45:36,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:36,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495768762] [2020-02-10 19:45:36,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:36,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728106402] [2020-02-10 19:45:36,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:36,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:36,597 INFO L87 Difference]: Start difference. First operand 798 states and 3182 transitions. Second operand 10 states. [2020-02-10 19:45:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,732 INFO L93 Difference]: Finished difference Result 1451 states and 5055 transitions. [2020-02-10 19:45:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:36,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,736 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 19:45:36,736 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:45:36,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:45:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-02-10 19:45:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3171 transitions. [2020-02-10 19:45:36,759 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3171 transitions. Word has length 25 [2020-02-10 19:45:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,759 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3171 transitions. [2020-02-10 19:45:36,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3171 transitions. [2020-02-10 19:45:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:36,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:36,760 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1154522449, now seen corresponding path program 177 times [2020-02-10 19:45:36,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643242425] [2020-02-10 19:45:36,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:37,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643242425] [2020-02-10 19:45:37,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:37,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904654923] [2020-02-10 19:45:37,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:37,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:37,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:37,171 INFO L87 Difference]: Start difference. First operand 794 states and 3171 transitions. Second operand 10 states. [2020-02-10 19:45:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,299 INFO L93 Difference]: Finished difference Result 1453 states and 5058 transitions. [2020-02-10 19:45:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:37,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,303 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 19:45:37,303 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 19:45:37,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 19:45:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 799. [2020-02-10 19:45:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:45:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3180 transitions. [2020-02-10 19:45:37,325 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3180 transitions. Word has length 25 [2020-02-10 19:45:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,326 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3180 transitions. [2020-02-10 19:45:37,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3180 transitions. [2020-02-10 19:45:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:37,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:37,327 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -142258419, now seen corresponding path program 178 times [2020-02-10 19:45:37,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175281808] [2020-02-10 19:45:37,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:37,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175281808] [2020-02-10 19:45:37,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:37,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178268185] [2020-02-10 19:45:37,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:37,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:37,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:37,714 INFO L87 Difference]: Start difference. First operand 799 states and 3180 transitions. Second operand 10 states. [2020-02-10 19:45:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,833 INFO L93 Difference]: Finished difference Result 1458 states and 5063 transitions. [2020-02-10 19:45:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:37,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,838 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 19:45:37,838 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 19:45:37,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 19:45:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 794. [2020-02-10 19:45:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3166 transitions. [2020-02-10 19:45:37,861 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3166 transitions. Word has length 25 [2020-02-10 19:45:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,861 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3166 transitions. [2020-02-10 19:45:37,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3166 transitions. [2020-02-10 19:45:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:37,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:37,863 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2016941303, now seen corresponding path program 179 times [2020-02-10 19:45:37,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851935267] [2020-02-10 19:45:37,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:38,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851935267] [2020-02-10 19:45:38,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:38,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357862573] [2020-02-10 19:45:38,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:38,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:38,246 INFO L87 Difference]: Start difference. First operand 794 states and 3166 transitions. Second operand 10 states. [2020-02-10 19:45:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,415 INFO L93 Difference]: Finished difference Result 1459 states and 5067 transitions. [2020-02-10 19:45:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:38,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,419 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 19:45:38,419 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:45:38,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:45:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 801. [2020-02-10 19:45:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:45:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3179 transitions. [2020-02-10 19:45:38,443 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3179 transitions. Word has length 25 [2020-02-10 19:45:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,443 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3179 transitions. [2020-02-10 19:45:38,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3179 transitions. [2020-02-10 19:45:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:38,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:38,445 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash -129229457, now seen corresponding path program 180 times [2020-02-10 19:45:38,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436372171] [2020-02-10 19:45:38,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,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 19:45:38,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436372171] [2020-02-10 19:45:38,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:38,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698506781] [2020-02-10 19:45:38,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:38,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:38,847 INFO L87 Difference]: Start difference. First operand 801 states and 3179 transitions. Second operand 10 states. [2020-02-10 19:45:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,977 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-02-10 19:45:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:38,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,981 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 19:45:38,981 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:45:38,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:45:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-02-10 19:45:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3152 transitions. [2020-02-10 19:45:39,004 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3152 transitions. Word has length 25 [2020-02-10 19:45:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,004 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3152 transitions. [2020-02-10 19:45:39,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3152 transitions. [2020-02-10 19:45:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:39,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:39,006 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1556594761, now seen corresponding path program 181 times [2020-02-10 19:45:39,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26733519] [2020-02-10 19:45:39,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:39,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26733519] [2020-02-10 19:45:39,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:39,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545013561] [2020-02-10 19:45:39,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:39,384 INFO L87 Difference]: Start difference. First operand 789 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:45:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,518 INFO L93 Difference]: Finished difference Result 1454 states and 5060 transitions. [2020-02-10 19:45:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:39,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,522 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 19:45:39,522 INFO L226 Difference]: Without dead ends: 1441 [2020-02-10 19:45:39,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-02-10 19:45:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 799. [2020-02-10 19:45:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:45:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-02-10 19:45:39,546 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-02-10 19:45:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,546 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-02-10 19:45:39,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-02-10 19:45:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:39,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:39,548 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -565336939, now seen corresponding path program 182 times [2020-02-10 19:45:39,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146589241] [2020-02-10 19:45:39,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,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 19:45:39,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146589241] [2020-02-10 19:45:39,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:39,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395115289] [2020-02-10 19:45:39,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:39,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:39,931 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-02-10 19:45:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,067 INFO L93 Difference]: Finished difference Result 1457 states and 5062 transitions. [2020-02-10 19:45:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:40,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,071 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:45:40,071 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 19:45:40,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 19:45:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 795. [2020-02-10 19:45:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-02-10 19:45:40,096 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,096 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-02-10 19:45:40,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-02-10 19:45:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:40,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,098 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1999493901, now seen corresponding path program 183 times [2020-02-10 19:45:40,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937655758] [2020-02-10 19:45:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:40,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937655758] [2020-02-10 19:45:40,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:40,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998382301] [2020-02-10 19:45:40,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:40,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:40,481 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,616 INFO L93 Difference]: Finished difference Result 1457 states and 5061 transitions. [2020-02-10 19:45:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:40,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,620 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:45:40,620 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:45:40,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:45:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 800. [2020-02-10 19:45:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:45:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3177 transitions. [2020-02-10 19:45:40,643 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3177 transitions. Word has length 25 [2020-02-10 19:45:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,644 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3177 transitions. [2020-02-10 19:45:40,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3177 transitions. [2020-02-10 19:45:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:40,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,645 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -987229871, now seen corresponding path program 184 times [2020-02-10 19:45:40,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679841143] [2020-02-10 19:45:40,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:41,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679841143] [2020-02-10 19:45:41,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:41,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076106026] [2020-02-10 19:45:41,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:41,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:41,062 INFO L87 Difference]: Start difference. First operand 800 states and 3177 transitions. Second operand 10 states. [2020-02-10 19:45:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,169 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-02-10 19:45:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:41,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,173 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 19:45:41,173 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 19:45:41,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 19:45:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 795. [2020-02-10 19:45:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3163 transitions. [2020-02-10 19:45:41,197 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3163 transitions. Word has length 25 [2020-02-10 19:45:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,197 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3163 transitions. [2020-02-10 19:45:41,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3163 transitions. [2020-02-10 19:45:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:41,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,198 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 750076919, now seen corresponding path program 185 times [2020-02-10 19:45:41,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012542057] [2020-02-10 19:45:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:41,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012542057] [2020-02-10 19:45:41,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:41,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420999342] [2020-02-10 19:45:41,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:41,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:41,597 INFO L87 Difference]: Start difference. First operand 795 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:45:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,732 INFO L93 Difference]: Finished difference Result 1467 states and 5078 transitions. [2020-02-10 19:45:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:41,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,736 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:45:41,736 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 19:45:41,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 19:45:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-02-10 19:45:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:45:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3179 transitions. [2020-02-10 19:45:41,760 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3179 transitions. Word has length 25 [2020-02-10 19:45:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,761 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3179 transitions. [2020-02-10 19:45:41,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3179 transitions. [2020-02-10 19:45:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:41,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:41,762 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash -323008461, now seen corresponding path program 186 times [2020-02-10 19:45:41,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162588627] [2020-02-10 19:45:41,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,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 19:45:42,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162588627] [2020-02-10 19:45:42,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:42,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970240621] [2020-02-10 19:45:42,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:42,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:42,166 INFO L87 Difference]: Start difference. First operand 804 states and 3179 transitions. Second operand 10 states. [2020-02-10 19:45:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,277 INFO L93 Difference]: Finished difference Result 1469 states and 5074 transitions. [2020-02-10 19:45:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:42,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,280 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 19:45:42,280 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:45:42,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:45:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 789. [2020-02-10 19:45:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:45:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-02-10 19:45:42,304 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-02-10 19:45:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,304 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-02-10 19:45:42,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-02-10 19:45:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:42,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,306 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash 38876945, now seen corresponding path program 187 times [2020-02-10 19:45:42,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860834012] [2020-02-10 19:45:42,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:42,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860834012] [2020-02-10 19:45:42,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:42,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683142484] [2020-02-10 19:45:42,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:42,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:42,714 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:45:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,864 INFO L93 Difference]: Finished difference Result 1469 states and 5093 transitions. [2020-02-10 19:45:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:42,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,868 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 19:45:42,869 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 19:45:42,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 19:45:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 804. [2020-02-10 19:45:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:45:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3186 transitions. [2020-02-10 19:45:42,892 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3186 transitions. Word has length 25 [2020-02-10 19:45:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,892 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3186 transitions. [2020-02-10 19:45:42,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3186 transitions. [2020-02-10 19:45:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:42,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,894 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1034208435, now seen corresponding path program 188 times [2020-02-10 19:45:42,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706008419] [2020-02-10 19:45:42,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:43,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706008419] [2020-02-10 19:45:43,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:43,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682874820] [2020-02-10 19:45:43,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:43,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:43,289 INFO L87 Difference]: Start difference. First operand 804 states and 3186 transitions. Second operand 10 states. [2020-02-10 19:45:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,456 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-02-10 19:45:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:43,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,460 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 19:45:43,460 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 19:45:43,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 19:45:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 798. [2020-02-10 19:45:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:45:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-02-10 19:45:43,487 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-02-10 19:45:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,487 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-02-10 19:45:43,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-02-10 19:45:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:43,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,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] [2020-02-10 19:45:43,489 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1132968533, now seen corresponding path program 189 times [2020-02-10 19:45:43,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271908296] [2020-02-10 19:45:43,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:43,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 19:45:43,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271908296] [2020-02-10 19:45:43,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:43,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573387450] [2020-02-10 19:45:43,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:43,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:43,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:43,885 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:45:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,022 INFO L93 Difference]: Finished difference Result 1472 states and 5092 transitions. [2020-02-10 19:45:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:44,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,026 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 19:45:44,027 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 19:45:44,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 19:45:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 805. [2020-02-10 19:45:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 19:45:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3182 transitions. [2020-02-10 19:45:44,051 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3182 transitions. Word has length 25 [2020-02-10 19:45:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,051 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3182 transitions. [2020-02-10 19:45:44,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3182 transitions. [2020-02-10 19:45:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:44,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:44,052 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1013202227, now seen corresponding path program 190 times [2020-02-10 19:45:44,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152246137] [2020-02-10 19:45:44,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:44,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152246137] [2020-02-10 19:45:44,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:44,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778112811] [2020-02-10 19:45:44,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:44,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:44,448 INFO L87 Difference]: Start difference. First operand 805 states and 3182 transitions. Second operand 10 states. [2020-02-10 19:45:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,557 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-02-10 19:45:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:44,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,561 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:45:44,561 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 19:45:44,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 19:45:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-02-10 19:45:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:45:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3162 transitions. [2020-02-10 19:45:44,584 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3162 transitions. Word has length 25 [2020-02-10 19:45:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,584 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3162 transitions. [2020-02-10 19:45:44,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3162 transitions. [2020-02-10 19:45:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:44,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:44,586 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:44,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1153974741, now seen corresponding path program 191 times [2020-02-10 19:45:44,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070676136] [2020-02-10 19:45:44,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:44,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070676136] [2020-02-10 19:45:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:44,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649206383] [2020-02-10 19:45:44,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:44,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:44,980 INFO L87 Difference]: Start difference. First operand 798 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:45:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,113 INFO L93 Difference]: Finished difference Result 1476 states and 5093 transitions. [2020-02-10 19:45:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:45,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,117 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 19:45:45,117 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 19:45:45,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 19:45:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 807. [2020-02-10 19:45:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:45:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3178 transitions. [2020-02-10 19:45:45,140 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3178 transitions. Word has length 25 [2020-02-10 19:45:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,141 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3178 transitions. [2020-02-10 19:45:45,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3178 transitions. [2020-02-10 19:45:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:45,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:45,142 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash 80889361, now seen corresponding path program 192 times [2020-02-10 19:45:45,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782393269] [2020-02-10 19:45:45,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:45,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782393269] [2020-02-10 19:45:45,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:45,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226576351] [2020-02-10 19:45:45,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:45,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:45,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:45,547 INFO L87 Difference]: Start difference. First operand 807 states and 3178 transitions. Second operand 10 states. [2020-02-10 19:45:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,659 INFO L93 Difference]: Finished difference Result 1478 states and 5089 transitions. [2020-02-10 19:45:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:45,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,662 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:45:45,663 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 19:45:45,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 19:45:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 782. [2020-02-10 19:45:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:45:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 19:45:45,685 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 19:45:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,685 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 19:45:45,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 19:45:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:45,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:45,687 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1867640017, now seen corresponding path program 193 times [2020-02-10 19:45:45,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132601653] [2020-02-10 19:45:45,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,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 19:45:46,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132601653] [2020-02-10 19:45:46,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:46,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230197143] [2020-02-10 19:45:46,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:46,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:46,095 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:45:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,238 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-02-10 19:45:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:46,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,242 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:45:46,242 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 19:45:46,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 19:45:46,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 793. [2020-02-10 19:45:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-02-10 19:45:46,267 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-02-10 19:45:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,267 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-02-10 19:45:46,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-02-10 19:45:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:46,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,268 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1446572561, now seen corresponding path program 194 times [2020-02-10 19:45:46,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463172968] [2020-02-10 19:45:46,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:46,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463172968] [2020-02-10 19:45:46,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:46,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049038112] [2020-02-10 19:45:46,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:46,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:46,659 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:45:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,798 INFO L93 Difference]: Finished difference Result 1413 states and 4952 transitions. [2020-02-10 19:45:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:46,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,802 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:45:46,802 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:45:46,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:45:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 790. [2020-02-10 19:45:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3156 transitions. [2020-02-10 19:45:46,825 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3156 transitions. Word has length 25 [2020-02-10 19:45:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,825 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3156 transitions. [2020-02-10 19:45:46,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3156 transitions. [2020-02-10 19:45:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:46,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,826 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash -501293201, now seen corresponding path program 195 times [2020-02-10 19:45:46,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044017370] [2020-02-10 19:45:46,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:47,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044017370] [2020-02-10 19:45:47,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:47,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851112610] [2020-02-10 19:45:47,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:47,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:47,201 INFO L87 Difference]: Start difference. First operand 790 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:45:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,335 INFO L93 Difference]: Finished difference Result 1419 states and 4965 transitions. [2020-02-10 19:45:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:47,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,339 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:45:47,340 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:45:47,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:45:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 19:45:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3163 transitions. [2020-02-10 19:45:47,362 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3163 transitions. Word has length 25 [2020-02-10 19:45:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,363 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3163 transitions. [2020-02-10 19:45:47,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3163 transitions. [2020-02-10 19:45:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:47,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:47,364 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 489964621, now seen corresponding path program 196 times [2020-02-10 19:45:47,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089705164] [2020-02-10 19:45:47,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:47,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089705164] [2020-02-10 19:45:47,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:47,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563607675] [2020-02-10 19:45:47,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:47,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:47,743 INFO L87 Difference]: Start difference. First operand 794 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:45:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,902 INFO L93 Difference]: Finished difference Result 1422 states and 4967 transitions. [2020-02-10 19:45:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:47,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,906 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:45:47,906 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:45:47,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:45:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 19:45:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:45:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-02-10 19:45:47,929 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-02-10 19:45:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,929 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-02-10 19:45:47,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-02-10 19:45:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:47,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:47,931 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash -782351151, now seen corresponding path program 197 times [2020-02-10 19:45:47,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074337627] [2020-02-10 19:45:47,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,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 19:45:48,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074337627] [2020-02-10 19:45:48,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:48,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98596034] [2020-02-10 19:45:48,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:48,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:48,316 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:45:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,448 INFO L93 Difference]: Finished difference Result 1416 states and 4955 transitions. [2020-02-10 19:45:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:48,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,451 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:45:48,451 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 19:45:48,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 19:45:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 793. [2020-02-10 19:45:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3158 transitions. [2020-02-10 19:45:48,473 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3158 transitions. Word has length 25 [2020-02-10 19:45:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,473 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3158 transitions. [2020-02-10 19:45:48,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3158 transitions. [2020-02-10 19:45:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:48,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:48,475 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,475 INFO L82 PathProgramCache]: Analyzing trace with hash 828589807, now seen corresponding path program 198 times [2020-02-10 19:45:48,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525343562] [2020-02-10 19:45:48,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:48,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525343562] [2020-02-10 19:45:48,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:48,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190238092] [2020-02-10 19:45:48,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:48,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:48,860 INFO L87 Difference]: Start difference. First operand 793 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:45:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,993 INFO L93 Difference]: Finished difference Result 1420 states and 4960 transitions. [2020-02-10 19:45:48,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:48,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,997 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 19:45:48,997 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:45:48,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:45:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 787. [2020-02-10 19:45:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:45:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-02-10 19:45:49,020 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-02-10 19:45:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,020 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-02-10 19:45:49,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-02-10 19:45:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:49,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,021 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1022668565, now seen corresponding path program 199 times [2020-02-10 19:45:49,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732914497] [2020-02-10 19:45:49,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:49,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732914497] [2020-02-10 19:45:49,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:49,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990046538] [2020-02-10 19:45:49,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:49,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:49,410 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:45:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,547 INFO L93 Difference]: Finished difference Result 1419 states and 4964 transitions. [2020-02-10 19:45:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:49,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,551 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:45:49,551 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:45:49,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:45:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 19:45:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 19:45:49,574 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 19:45:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,574 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 19:45:49,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 19:45:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:49,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:49,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:49,576 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2003423283, now seen corresponding path program 200 times [2020-02-10 19:45:49,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503207127] [2020-02-10 19:45:49,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:49,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503207127] [2020-02-10 19:45:49,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:49,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180096917] [2020-02-10 19:45:49,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:49,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:49,976 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:45:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,113 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-02-10 19:45:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:50,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,118 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:45:50,118 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:45:50,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:45:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 791. [2020-02-10 19:45:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-02-10 19:45:50,142 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-02-10 19:45:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,142 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-02-10 19:45:50,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-02-10 19:45:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:50,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,143 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1789163793, now seen corresponding path program 201 times [2020-02-10 19:45:50,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481828489] [2020-02-10 19:45:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:50,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481828489] [2020-02-10 19:45:50,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:50,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807168197] [2020-02-10 19:45:50,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:50,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:50,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:50,545 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:45:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,678 INFO L93 Difference]: Finished difference Result 1427 states and 4977 transitions. [2020-02-10 19:45:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:50,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,682 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 19:45:50,682 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:45:50,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:45:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-02-10 19:45:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:45:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3165 transitions. [2020-02-10 19:45:50,705 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3165 transitions. Word has length 25 [2020-02-10 19:45:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,705 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3165 transitions. [2020-02-10 19:45:50,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3165 transitions. [2020-02-10 19:45:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:50,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,707 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash -776899763, now seen corresponding path program 202 times [2020-02-10 19:45:50,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105265780] [2020-02-10 19:45:50,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:51,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105265780] [2020-02-10 19:45:51,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:51,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701301108] [2020-02-10 19:45:51,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:51,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:51,095 INFO L87 Difference]: Start difference. First operand 796 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:45:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,228 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-02-10 19:45:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:51,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,232 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:45:51,233 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:45:51,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:45:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 791. [2020-02-10 19:45:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:45:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-02-10 19:45:51,256 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-02-10 19:45:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,257 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-02-10 19:45:51,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-02-10 19:45:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:51,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:51,258 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash -976130155, now seen corresponding path program 203 times [2020-02-10 19:45:51,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695040935] [2020-02-10 19:45:51,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:51,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695040935] [2020-02-10 19:45:51,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:51,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328483490] [2020-02-10 19:45:51,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:51,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:51,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:51,631 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:45:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,799 INFO L93 Difference]: Finished difference Result 1424 states and 4966 transitions. [2020-02-10 19:45:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:51,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,803 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:45:51,803 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:45:51,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:45:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 19:45:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3159 transitions. [2020-02-10 19:45:51,834 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3159 transitions. Word has length 25 [2020-02-10 19:45:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,834 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3159 transitions. [2020-02-10 19:45:51,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3159 transitions. [2020-02-10 19:45:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:51,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:51,835 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash -438274577, now seen corresponding path program 204 times [2020-02-10 19:45:51,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249659591] [2020-02-10 19:45:51,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:52,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249659591] [2020-02-10 19:45:52,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:52,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465416588] [2020-02-10 19:45:52,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:52,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:52,221 INFO L87 Difference]: Start difference. First operand 795 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:45:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,338 INFO L93 Difference]: Finished difference Result 1430 states and 4974 transitions. [2020-02-10 19:45:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:52,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,342 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 19:45:52,343 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 19:45:52,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 19:45:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 787. [2020-02-10 19:45:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:45:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 19:45:52,367 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 19:45:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,367 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 19:45:52,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 19:45:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:52,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:52,368 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1768750379, now seen corresponding path program 205 times [2020-02-10 19:45:52,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048044121] [2020-02-10 19:45:52,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:52,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048044121] [2020-02-10 19:45:52,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:52,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794450578] [2020-02-10 19:45:52,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:52,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:52,779 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:45:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,911 INFO L93 Difference]: Finished difference Result 1436 states and 5001 transitions. [2020-02-10 19:45:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:52,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,914 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 19:45:52,914 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 19:45:52,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 19:45:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 797. [2020-02-10 19:45:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:45:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 19:45:52,937 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,937 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 19:45:52,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 19:45:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:52,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,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] [2020-02-10 19:45:52,938 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -777492557, now seen corresponding path program 206 times [2020-02-10 19:45:52,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859701101] [2020-02-10 19:45:52,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:53,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859701101] [2020-02-10 19:45:53,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:53,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242474865] [2020-02-10 19:45:53,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:53,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:53,327 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,465 INFO L93 Difference]: Finished difference Result 1439 states and 5003 transitions. [2020-02-10 19:45:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:53,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,469 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:45:53,470 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 19:45:53,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 19:45:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 793. [2020-02-10 19:45:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 19:45:53,493 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 19:45:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,493 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 19:45:53,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 19:45:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:53,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,494 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2083317777, now seen corresponding path program 207 times [2020-02-10 19:45:53,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349187273] [2020-02-10 19:45:53,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:53,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349187273] [2020-02-10 19:45:53,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:53,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588051359] [2020-02-10 19:45:53,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:53,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:53,875 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:45:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,010 INFO L93 Difference]: Finished difference Result 1439 states and 5002 transitions. [2020-02-10 19:45:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:54,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,014 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:45:54,015 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 19:45:54,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 19:45:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-02-10 19:45:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:45:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-02-10 19:45:54,038 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-02-10 19:45:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,038 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-02-10 19:45:54,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-02-10 19:45:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:54,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:54,039 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1199385489, now seen corresponding path program 208 times [2020-02-10 19:45:54,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922756794] [2020-02-10 19:45:54,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:54,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922756794] [2020-02-10 19:45:54,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:54,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682422971] [2020-02-10 19:45:54,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:54,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:54,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:54,450 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-02-10 19:45:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,592 INFO L93 Difference]: Finished difference Result 1444 states and 5007 transitions. [2020-02-10 19:45:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:54,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,596 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:45:54,596 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 19:45:54,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 19:45:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 793. [2020-02-10 19:45:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:45:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 19:45:54,620 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 19:45:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,620 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 19:45:54,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 19:45:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:54,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:54,621 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 537921301, now seen corresponding path program 209 times [2020-02-10 19:45:54,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267364059] [2020-02-10 19:45:54,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:55,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267364059] [2020-02-10 19:45:55,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:55,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734776874] [2020-02-10 19:45:55,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:55,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:55,009 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:45:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,177 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-02-10 19:45:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:55,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,181 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:45:55,181 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 19:45:55,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 19:45:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-02-10 19:45:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:45:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3168 transitions. [2020-02-10 19:45:55,204 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3168 transitions. Word has length 25 [2020-02-10 19:45:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,204 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3168 transitions. [2020-02-10 19:45:55,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3168 transitions. [2020-02-10 19:45:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:55,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:55,205 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash -535164079, now seen corresponding path program 210 times [2020-02-10 19:45:55,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372300558] [2020-02-10 19:45:55,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:55,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372300558] [2020-02-10 19:45:55,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:55,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967502416] [2020-02-10 19:45:55,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:55,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:55,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:55,598 INFO L87 Difference]: Start difference. First operand 802 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:45:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,710 INFO L93 Difference]: Finished difference Result 1451 states and 5015 transitions. [2020-02-10 19:45:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:55,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,716 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 19:45:55,716 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:45:55,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:45:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 787. [2020-02-10 19:45:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:45:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-02-10 19:45:55,750 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-02-10 19:45:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,750 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-02-10 19:45:55,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-02-10 19:45:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:55,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:55,752 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1340772783, now seen corresponding path program 211 times [2020-02-10 19:45:55,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096072543] [2020-02-10 19:45:55,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,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 19:45:56,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096072543] [2020-02-10 19:45:56,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:56,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700212755] [2020-02-10 19:45:56,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:56,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:56,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:56,140 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:45:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,273 INFO L93 Difference]: Finished difference Result 1429 states and 4977 transitions. [2020-02-10 19:45:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:56,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,277 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:45:56,277 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 19:45:56,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 19:45:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 795. [2020-02-10 19:45:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:45:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-02-10 19:45:56,300 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-02-10 19:45:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,300 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-02-10 19:45:56,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-02-10 19:45:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:56,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,302 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253555, now seen corresponding path program 212 times [2020-02-10 19:45:56,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053280871] [2020-02-10 19:45:56,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:56,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053280871] [2020-02-10 19:45:56,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:56,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965987184] [2020-02-10 19:45:56,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:56,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:56,695 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:45:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,847 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-02-10 19:45:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:56,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,851 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 19:45:56,851 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:45:56,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:45:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 792. [2020-02-10 19:45:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:45:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 19:45:56,874 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 19:45:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,874 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 19:45:56,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 19:45:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:56,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,876 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:56,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1860102925, now seen corresponding path program 213 times [2020-02-10 19:45:56,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936397722] [2020-02-10 19:45:56,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:57,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936397722] [2020-02-10 19:45:57,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846227275] [2020-02-10 19:45:57,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:57,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:57,277 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:45:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,409 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-02-10 19:45:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:57,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,413 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:45:57,413 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 19:45:57,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 19:45:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 796. [2020-02-10 19:45:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:45:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-02-10 19:45:57,436 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-02-10 19:45:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,436 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-02-10 19:45:57,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-02-10 19:45:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:57,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,438 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1322247347, now seen corresponding path program 214 times [2020-02-10 19:45:57,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50501173] [2020-02-10 19:45:57,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:57,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50501173] [2020-02-10 19:45:57,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:57,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238521373] [2020-02-10 19:45:57,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:57,851 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:45:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,987 INFO L93 Difference]: Finished difference Result 1438 states and 4987 transitions. [2020-02-10 19:45:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:57,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,991 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 19:45:57,991 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:45:57,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:45:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 792. [2020-02-10 19:45:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:45:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 19:45:58,015 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 19:45:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,015 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 19:45:58,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 19:45:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:58,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:58,017 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1849599821, now seen corresponding path program 215 times [2020-02-10 19:45:58,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613177987] [2020-02-10 19:45:58,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:58,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613177987] [2020-02-10 19:45:58,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:58,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972221518] [2020-02-10 19:45:58,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:58,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:58,428 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:45:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,558 INFO L93 Difference]: Finished difference Result 1445 states and 5004 transitions. [2020-02-10 19:45:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:58,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,562 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 19:45:58,563 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 19:45:58,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 19:45:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 801. [2020-02-10 19:45:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:45:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3161 transitions. [2020-02-10 19:45:58,586 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3161 transitions. Word has length 25 [2020-02-10 19:45:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,586 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3161 transitions. [2020-02-10 19:45:58,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3161 transitions. [2020-02-10 19:45:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:58,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:58,588 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1372282095, now seen corresponding path program 216 times [2020-02-10 19:45:58,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933334261] [2020-02-10 19:45:58,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,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 19:45:58,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933334261] [2020-02-10 19:45:58,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:58,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165392275] [2020-02-10 19:45:58,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:58,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:58,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:58,982 INFO L87 Difference]: Start difference. First operand 801 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:45:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,096 INFO L93 Difference]: Finished difference Result 1447 states and 5000 transitions. [2020-02-10 19:45:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:59,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,100 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:45:59,101 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:45:59,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:45:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 782. [2020-02-10 19:45:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:45:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3122 transitions. [2020-02-10 19:45:59,125 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3122 transitions. Word has length 25 [2020-02-10 19:45:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,125 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3122 transitions. [2020-02-10 19:45:59,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3122 transitions. [2020-02-10 19:45:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:59,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,126 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash -842530889, now seen corresponding path program 217 times [2020-02-10 19:45:59,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390223099] [2020-02-10 19:45:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:59,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390223099] [2020-02-10 19:45:59,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:45:59,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997994675] [2020-02-10 19:45:59,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:45:59,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:45:59,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:45:59,508 INFO L87 Difference]: Start difference. First operand 782 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:45:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,659 INFO L93 Difference]: Finished difference Result 1432 states and 4997 transitions. [2020-02-10 19:45:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:45:59,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:45:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,664 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:45:59,664 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 19:45:59,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 19:45:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-02-10 19:45:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:45:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3161 transitions. [2020-02-10 19:45:59,688 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3161 transitions. Word has length 25 [2020-02-10 19:45:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,689 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3161 transitions. [2020-02-10 19:45:59,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:45:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3161 transitions. [2020-02-10 19:45:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:45:59,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,690 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 768410069, now seen corresponding path program 218 times [2020-02-10 19:45:59,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244738824] [2020-02-10 19:45:59,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:00,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244738824] [2020-02-10 19:46:00,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:00,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606488722] [2020-02-10 19:46:00,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:00,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:00,087 INFO L87 Difference]: Start difference. First operand 794 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:46:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,227 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 19:46:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:00,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,231 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:46:00,231 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:46:00,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:46:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-02-10 19:46:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3153 transitions. [2020-02-10 19:46:00,254 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3153 transitions. Word has length 25 [2020-02-10 19:46:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,254 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3153 transitions. [2020-02-10 19:46:00,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3153 transitions. [2020-02-10 19:46:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:00,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,255 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1851998553, now seen corresponding path program 219 times [2020-02-10 19:46:00,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803667542] [2020-02-10 19:46:00,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:00,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803667542] [2020-02-10 19:46:00,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:00,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136933241] [2020-02-10 19:46:00,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:00,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:00,636 INFO L87 Difference]: Start difference. First operand 791 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:46:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,778 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-02-10 19:46:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:00,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,782 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:46:00,782 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:46:00,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:46:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-02-10 19:46:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:46:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3164 transitions. [2020-02-10 19:46:00,806 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3164 transitions. Word has length 25 [2020-02-10 19:46:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,806 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3164 transitions. [2020-02-10 19:46:00,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3164 transitions. [2020-02-10 19:46:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:00,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,807 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 778913173, now seen corresponding path program 220 times [2020-02-10 19:46:00,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840519605] [2020-02-10 19:46:00,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:01,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840519605] [2020-02-10 19:46:01,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:01,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832095603] [2020-02-10 19:46:01,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:01,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:01,194 INFO L87 Difference]: Start difference. First operand 797 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:46:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,336 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-02-10 19:46:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:01,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,340 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:46:01,340 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:46:01,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:46:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-02-10 19:46:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 19:46:01,363 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,364 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 19:46:01,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 19:46:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:01,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,365 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1862501657, now seen corresponding path program 221 times [2020-02-10 19:46:01,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522807156] [2020-02-10 19:46:01,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:01,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522807156] [2020-02-10 19:46:01,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:01,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819173347] [2020-02-10 19:46:01,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:01,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:01,753 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,912 INFO L93 Difference]: Finished difference Result 1430 states and 4987 transitions. [2020-02-10 19:46:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:01,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,917 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 19:46:01,917 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:46:01,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:46:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-02-10 19:46:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:46:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-02-10 19:46:01,941 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-02-10 19:46:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,941 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-02-10 19:46:01,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-02-10 19:46:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:01,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,943 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash -821524681, now seen corresponding path program 222 times [2020-02-10 19:46:01,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749208654] [2020-02-10 19:46:01,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:02,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749208654] [2020-02-10 19:46:02,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:02,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336538518] [2020-02-10 19:46:02,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:02,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:02,358 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:46:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,497 INFO L93 Difference]: Finished difference Result 1434 states and 4992 transitions. [2020-02-10 19:46:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:02,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,501 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:46:02,501 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:46:02,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:46:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 788. [2020-02-10 19:46:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 19:46:02,525 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 19:46:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,525 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 19:46:02,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 19:46:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:02,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,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] [2020-02-10 19:46:02,527 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1285430029, now seen corresponding path program 223 times [2020-02-10 19:46:02,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597878763] [2020-02-10 19:46:02,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:02,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597878763] [2020-02-10 19:46:02,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:02,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822014410] [2020-02-10 19:46:02,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:02,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:02,912 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:46:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,049 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-02-10 19:46:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:03,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,053 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 19:46:03,053 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 19:46:03,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 19:46:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-02-10 19:46:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:46:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-02-10 19:46:03,078 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-02-10 19:46:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,078 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-02-10 19:46:03,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-02-10 19:46:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:03,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:03,079 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 325510929, now seen corresponding path program 224 times [2020-02-10 19:46:03,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973293185] [2020-02-10 19:46:03,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973293185] [2020-02-10 19:46:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538112881] [2020-02-10 19:46:03,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:03,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:03,481 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:46:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,622 INFO L93 Difference]: Finished difference Result 1434 states and 4995 transitions. [2020-02-10 19:46:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:03,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,626 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:46:03,626 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 19:46:03,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 19:46:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-02-10 19:46:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:46:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-02-10 19:46:03,650 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-02-10 19:46:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,650 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-02-10 19:46:03,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-02-10 19:46:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:03,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:03,651 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1791776295, now seen corresponding path program 225 times [2020-02-10 19:46:03,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281235358] [2020-02-10 19:46:03,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:04,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281235358] [2020-02-10 19:46:04,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:04,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242040461] [2020-02-10 19:46:04,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:04,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:04,039 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:46:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,201 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-02-10 19:46:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:04,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,205 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:46:04,205 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:46:04,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:46:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 799. [2020-02-10 19:46:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:46:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3166 transitions. [2020-02-10 19:46:04,230 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3166 transitions. Word has length 25 [2020-02-10 19:46:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,230 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3166 transitions. [2020-02-10 19:46:04,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3166 transitions. [2020-02-10 19:46:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:04,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,231 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash 357020241, now seen corresponding path program 226 times [2020-02-10 19:46:04,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586023603] [2020-02-10 19:46:04,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:04,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586023603] [2020-02-10 19:46:04,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:04,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646409045] [2020-02-10 19:46:04,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:04,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:04,637 INFO L87 Difference]: Start difference. First operand 799 states and 3166 transitions. Second operand 10 states. [2020-02-10 19:46:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,753 INFO L93 Difference]: Finished difference Result 1450 states and 5022 transitions. [2020-02-10 19:46:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:04,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,757 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:46:04,757 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 19:46:04,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 19:46:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 792. [2020-02-10 19:46:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:46:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 19:46:04,780 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 19:46:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,780 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 19:46:04,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 19:46:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:04,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,781 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1781273191, now seen corresponding path program 227 times [2020-02-10 19:46:04,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662662547] [2020-02-10 19:46:04,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:05,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662662547] [2020-02-10 19:46:05,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:05,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264925727] [2020-02-10 19:46:05,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:05,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:05,170 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:46:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,328 INFO L93 Difference]: Finished difference Result 1438 states and 4998 transitions. [2020-02-10 19:46:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:05,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,332 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 19:46:05,332 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 19:46:05,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 19:46:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 796. [2020-02-10 19:46:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:46:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-02-10 19:46:05,356 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-02-10 19:46:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,357 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-02-10 19:46:05,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-02-10 19:46:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:05,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,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] [2020-02-10 19:46:05,358 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1243417613, now seen corresponding path program 228 times [2020-02-10 19:46:05,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454943329] [2020-02-10 19:46:05,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:05,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454943329] [2020-02-10 19:46:05,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:05,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300218852] [2020-02-10 19:46:05,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:05,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:05,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:05,762 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:46:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,883 INFO L93 Difference]: Finished difference Result 1444 states and 5006 transitions. [2020-02-10 19:46:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:05,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,887 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:46:05,887 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:46:05,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:46:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 788. [2020-02-10 19:46:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 19:46:05,911 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 19:46:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,911 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 19:46:05,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 19:46:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:05,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:05,913 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash -959833805, now seen corresponding path program 229 times [2020-02-10 19:46:05,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556300327] [2020-02-10 19:46:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:06,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556300327] [2020-02-10 19:46:06,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:06,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916596643] [2020-02-10 19:46:06,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:06,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:06,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:06,305 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:46:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,451 INFO L93 Difference]: Finished difference Result 1461 states and 5062 transitions. [2020-02-10 19:46:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:06,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,455 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 19:46:06,455 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 19:46:06,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 19:46:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 803. [2020-02-10 19:46:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:46:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3178 transitions. [2020-02-10 19:46:06,480 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3178 transitions. Word has length 25 [2020-02-10 19:46:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,480 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3178 transitions. [2020-02-10 19:46:06,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3178 transitions. [2020-02-10 19:46:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:06,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,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] [2020-02-10 19:46:06,481 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2032919185, now seen corresponding path program 230 times [2020-02-10 19:46:06,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768637363] [2020-02-10 19:46:06,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:06,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768637363] [2020-02-10 19:46:06,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:06,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186743532] [2020-02-10 19:46:06,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:06,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:06,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:06,876 INFO L87 Difference]: Start difference. First operand 803 states and 3178 transitions. Second operand 10 states. [2020-02-10 19:46:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,022 INFO L93 Difference]: Finished difference Result 1462 states and 5058 transitions. [2020-02-10 19:46:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:07,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,026 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 19:46:07,026 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 19:46:07,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 19:46:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 797. [2020-02-10 19:46:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:46:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 19:46:07,049 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 19:46:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,049 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 19:46:07,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 19:46:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:07,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,050 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash 134257783, now seen corresponding path program 231 times [2020-02-10 19:46:07,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647595789] [2020-02-10 19:46:07,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,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 19:46:07,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647595789] [2020-02-10 19:46:07,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:07,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599451824] [2020-02-10 19:46:07,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:07,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:07,442 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:46:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,618 INFO L93 Difference]: Finished difference Result 1464 states and 5061 transitions. [2020-02-10 19:46:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:07,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,622 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 19:46:07,623 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 19:46:07,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 19:46:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 804. [2020-02-10 19:46:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:46:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-02-10 19:46:07,646 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-02-10 19:46:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,646 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-02-10 19:46:07,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-02-10 19:46:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:07,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,648 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2011912977, now seen corresponding path program 232 times [2020-02-10 19:46:07,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370609857] [2020-02-10 19:46:07,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:08,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370609857] [2020-02-10 19:46:08,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:08,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364465228] [2020-02-10 19:46:08,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:08,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:08,044 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-02-10 19:46:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,193 INFO L93 Difference]: Finished difference Result 1467 states and 5060 transitions. [2020-02-10 19:46:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:08,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,197 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:46:08,197 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 19:46:08,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 19:46:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 797. [2020-02-10 19:46:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:46:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-02-10 19:46:08,230 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-02-10 19:46:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,230 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-02-10 19:46:08,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-02-10 19:46:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:08,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,231 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash 155263991, now seen corresponding path program 233 times [2020-02-10 19:46:08,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712591427] [2020-02-10 19:46:08,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:08,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712591427] [2020-02-10 19:46:08,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:08,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471475431] [2020-02-10 19:46:08,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:08,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:08,630 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:46:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,772 INFO L93 Difference]: Finished difference Result 1468 states and 5062 transitions. [2020-02-10 19:46:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:08,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,776 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 19:46:08,776 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 19:46:08,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 19:46:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 806. [2020-02-10 19:46:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 19:46:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3170 transitions. [2020-02-10 19:46:08,799 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3170 transitions. Word has length 25 [2020-02-10 19:46:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,799 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3170 transitions. [2020-02-10 19:46:08,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3170 transitions. [2020-02-10 19:46:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:08,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,801 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash -917821389, now seen corresponding path program 234 times [2020-02-10 19:46:08,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917112747] [2020-02-10 19:46:08,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:09,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917112747] [2020-02-10 19:46:09,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:09,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716254911] [2020-02-10 19:46:09,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:09,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:09,202 INFO L87 Difference]: Start difference. First operand 806 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:46:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,362 INFO L93 Difference]: Finished difference Result 1470 states and 5058 transitions. [2020-02-10 19:46:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:09,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,366 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 19:46:09,366 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:46:09,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:46:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 788. [2020-02-10 19:46:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3132 transitions. [2020-02-10 19:46:09,389 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3132 transitions. Word has length 25 [2020-02-10 19:46:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,389 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3132 transitions. [2020-02-10 19:46:09,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3132 transitions. [2020-02-10 19:46:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:09,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:09,390 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 976703377, now seen corresponding path program 235 times [2020-02-10 19:46:09,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013366764] [2020-02-10 19:46:09,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:09,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013366764] [2020-02-10 19:46:09,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:09,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890719327] [2020-02-10 19:46:09,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:09,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:09,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:09,773 INFO L87 Difference]: Start difference. First operand 788 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:46:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,935 INFO L93 Difference]: Finished difference Result 1439 states and 4998 transitions. [2020-02-10 19:46:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:09,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,939 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:46:09,940 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 19:46:09,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 19:46:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 796. [2020-02-10 19:46:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:46:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-02-10 19:46:09,963 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-02-10 19:46:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,963 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-02-10 19:46:09,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-02-10 19:46:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:09,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:09,964 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1707322961, now seen corresponding path program 236 times [2020-02-10 19:46:09,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064638352] [2020-02-10 19:46:09,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:10,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064638352] [2020-02-10 19:46:10,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:10,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692004498] [2020-02-10 19:46:10,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:10,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:10,344 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:46:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,482 INFO L93 Difference]: Finished difference Result 1443 states and 5003 transitions. [2020-02-10 19:46:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:10,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,487 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 19:46:10,487 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:46:10,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:46:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-02-10 19:46:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-02-10 19:46:10,520 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-02-10 19:46:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,520 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-02-10 19:46:10,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-02-10 19:46:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:10,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:10,522 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2070794965, now seen corresponding path program 237 times [2020-02-10 19:46:10,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706713525] [2020-02-10 19:46:10,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:10,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706713525] [2020-02-10 19:46:10,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:10,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953422279] [2020-02-10 19:46:10,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:10,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:10,902 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:46:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,040 INFO L93 Difference]: Finished difference Result 1442 states and 5000 transitions. [2020-02-10 19:46:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:11,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,044 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 19:46:11,044 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:46:11,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:46:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 797. [2020-02-10 19:46:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:46:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3152 transitions. [2020-02-10 19:46:11,067 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3152 transitions. Word has length 25 [2020-02-10 19:46:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,067 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3152 transitions. [2020-02-10 19:46:11,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3152 transitions. [2020-02-10 19:46:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:11,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:11,068 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1686316753, now seen corresponding path program 238 times [2020-02-10 19:46:11,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519492074] [2020-02-10 19:46:11,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,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 19:46:11,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519492074] [2020-02-10 19:46:11,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:11,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258672279] [2020-02-10 19:46:11,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:11,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:11,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:11,472 INFO L87 Difference]: Start difference. First operand 797 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:46:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,598 INFO L93 Difference]: Finished difference Result 1448 states and 5008 transitions. [2020-02-10 19:46:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:11,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,602 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 19:46:11,602 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 19:46:11,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 19:46:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 793. [2020-02-10 19:46:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3141 transitions. [2020-02-10 19:46:11,626 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3141 transitions. Word has length 25 [2020-02-10 19:46:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,626 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3141 transitions. [2020-02-10 19:46:11,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3141 transitions. [2020-02-10 19:46:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:11,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:11,627 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2081298069, now seen corresponding path program 239 times [2020-02-10 19:46:11,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526202810] [2020-02-10 19:46:11,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:12,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526202810] [2020-02-10 19:46:12,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:12,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387033897] [2020-02-10 19:46:12,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:12,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:12,020 INFO L87 Difference]: Start difference. First operand 793 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:46:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,157 INFO L93 Difference]: Finished difference Result 1455 states and 5025 transitions. [2020-02-10 19:46:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:12,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,161 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 19:46:12,161 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 19:46:12,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 19:46:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 802. [2020-02-10 19:46:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:46:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3157 transitions. [2020-02-10 19:46:12,185 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3157 transitions. Word has length 25 [2020-02-10 19:46:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,185 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3157 transitions. [2020-02-10 19:46:12,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3157 transitions. [2020-02-10 19:46:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:12,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:12,186 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1008212689, now seen corresponding path program 240 times [2020-02-10 19:46:12,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521388491] [2020-02-10 19:46:12,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:12,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521388491] [2020-02-10 19:46:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184804923] [2020-02-10 19:46:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:12,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:12,581 INFO L87 Difference]: Start difference. First operand 802 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:46:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,710 INFO L93 Difference]: Finished difference Result 1457 states and 5021 transitions. [2020-02-10 19:46:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:12,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,714 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:46:12,714 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 19:46:12,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 19:46:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 776. [2020-02-10 19:46:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:46:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3105 transitions. [2020-02-10 19:46:12,738 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3105 transitions. Word has length 25 [2020-02-10 19:46:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,738 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3105 transitions. [2020-02-10 19:46:12,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3105 transitions. [2020-02-10 19:46:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:12,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:12,739 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash -858812617, now seen corresponding path program 241 times [2020-02-10 19:46:12,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360420778] [2020-02-10 19:46:12,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:13,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360420778] [2020-02-10 19:46:13,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:13,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23738750] [2020-02-10 19:46:13,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:13,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:13,111 INFO L87 Difference]: Start difference. First operand 776 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:46:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,251 INFO L93 Difference]: Finished difference Result 1381 states and 4884 transitions. [2020-02-10 19:46:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:13,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,255 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 19:46:13,255 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:46:13,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:46:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 790. [2020-02-10 19:46:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-02-10 19:46:13,278 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-02-10 19:46:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,279 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-02-10 19:46:13,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-02-10 19:46:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:13,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,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] [2020-02-10 19:46:13,280 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash 111438997, now seen corresponding path program 242 times [2020-02-10 19:46:13,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175310166] [2020-02-10 19:46:13,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:13,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175310166] [2020-02-10 19:46:13,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:13,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321086134] [2020-02-10 19:46:13,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:13,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:13,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:13,657 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:46:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,796 INFO L93 Difference]: Finished difference Result 1383 states and 4884 transitions. [2020-02-10 19:46:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:13,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,800 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 19:46:13,800 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:46:13,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:46:13,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 786. [2020-02-10 19:46:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:46:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-02-10 19:46:13,823 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-02-10 19:46:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,823 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-02-10 19:46:13,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-02-10 19:46:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:13,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,824 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1067221461, now seen corresponding path program 243 times [2020-02-10 19:46:13,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931974822] [2020-02-10 19:46:13,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:14,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931974822] [2020-02-10 19:46:14,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:14,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518232124] [2020-02-10 19:46:14,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:14,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:14,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:14,210 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:46:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,344 INFO L93 Difference]: Finished difference Result 1377 states and 4872 transitions. [2020-02-10 19:46:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:14,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,348 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 19:46:14,349 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:46:14,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:46:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-02-10 19:46:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 19:46:14,371 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 19:46:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,371 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 19:46:14,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 19:46:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:14,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:14,373 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2047976179, now seen corresponding path program 244 times [2020-02-10 19:46:14,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266436913] [2020-02-10 19:46:14,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:14,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266436913] [2020-02-10 19:46:14,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:14,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269627024] [2020-02-10 19:46:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:14,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:14,774 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:46:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,918 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-02-10 19:46:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:14,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,922 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:46:14,922 INFO L226 Difference]: Without dead ends: 1361 [2020-02-10 19:46:14,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-02-10 19:46:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 786. [2020-02-10 19:46:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:46:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-02-10 19:46:14,945 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-02-10 19:46:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,945 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-02-10 19:46:14,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-02-10 19:46:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:14,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:14,947 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 450064183, now seen corresponding path program 245 times [2020-02-10 19:46:14,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530554458] [2020-02-10 19:46:14,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:15,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530554458] [2020-02-10 19:46:15,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:15,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081658220] [2020-02-10 19:46:15,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:15,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:15,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:15,325 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:46:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,463 INFO L93 Difference]: Finished difference Result 1381 states and 4877 transitions. [2020-02-10 19:46:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:15,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,467 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 19:46:15,467 INFO L226 Difference]: Without dead ends: 1366 [2020-02-10 19:46:15,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-02-10 19:46:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 789. [2020-02-10 19:46:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 19:46:15,490 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 19:46:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,490 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 19:46:15,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 19:46:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:15,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,491 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2061005141, now seen corresponding path program 246 times [2020-02-10 19:46:15,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101887254] [2020-02-10 19:46:15,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:15,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101887254] [2020-02-10 19:46:15,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:15,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608246730] [2020-02-10 19:46:15,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:15,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:15,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:15,875 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:46:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,014 INFO L93 Difference]: Finished difference Result 1378 states and 4868 transitions. [2020-02-10 19:46:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:16,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,018 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 19:46:16,018 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 19:46:16,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 19:46:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 783. [2020-02-10 19:46:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:46:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3138 transitions. [2020-02-10 19:46:16,040 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3138 transitions. Word has length 25 [2020-02-10 19:46:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,040 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3138 transitions. [2020-02-10 19:46:16,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3138 transitions. [2020-02-10 19:46:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:16,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:16,042 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1703784069, now seen corresponding path program 247 times [2020-02-10 19:46:16,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255770758] [2020-02-10 19:46:16,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,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 19:46:16,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255770758] [2020-02-10 19:46:16,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:16,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078710396] [2020-02-10 19:46:16,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:16,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:16,430 INFO L87 Difference]: Start difference. First operand 783 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:46:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,583 INFO L93 Difference]: Finished difference Result 1387 states and 4898 transitions. [2020-02-10 19:46:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:16,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,587 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:46:16,587 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:46:16,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:46:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-02-10 19:46:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-02-10 19:46:16,611 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-02-10 19:46:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,611 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-02-10 19:46:16,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-02-10 19:46:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:16,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:16,612 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,613 INFO L82 PathProgramCache]: Analyzing trace with hash -733532455, now seen corresponding path program 248 times [2020-02-10 19:46:16,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953574353] [2020-02-10 19:46:16,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:17,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953574353] [2020-02-10 19:46:17,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:17,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908097564] [2020-02-10 19:46:17,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:17,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:17,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:17,001 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:46:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,127 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 19:46:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:17,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,131 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:46:17,131 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 19:46:17,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 19:46:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 19:46:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:46:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3149 transitions. [2020-02-10 19:46:17,154 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3149 transitions. Word has length 25 [2020-02-10 19:46:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,154 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3149 transitions. [2020-02-10 19:46:17,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3149 transitions. [2020-02-10 19:46:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:17,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,156 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:17,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,156 INFO L82 PathProgramCache]: Analyzing trace with hash -220649131, now seen corresponding path program 249 times [2020-02-10 19:46:17,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219291908] [2020-02-10 19:46:17,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:17,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219291908] [2020-02-10 19:46:17,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:17,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077098893] [2020-02-10 19:46:17,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:17,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:17,550 INFO L87 Difference]: Start difference. First operand 787 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:46:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,682 INFO L93 Difference]: Finished difference Result 1386 states and 4892 transitions. [2020-02-10 19:46:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:17,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,688 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 19:46:17,688 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:46:17,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:46:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 791. [2020-02-10 19:46:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-02-10 19:46:17,722 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-02-10 19:46:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,722 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-02-10 19:46:17,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-02-10 19:46:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:17,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,724 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,725 INFO L82 PathProgramCache]: Analyzing trace with hash 781111795, now seen corresponding path program 250 times [2020-02-10 19:46:17,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974590541] [2020-02-10 19:46:17,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:18,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974590541] [2020-02-10 19:46:18,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:18,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503787194] [2020-02-10 19:46:18,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:18,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:18,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:18,118 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:46:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,258 INFO L93 Difference]: Finished difference Result 1387 states and 4890 transitions. [2020-02-10 19:46:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:18,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,263 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:46:18,263 INFO L226 Difference]: Without dead ends: 1369 [2020-02-10 19:46:18,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-02-10 19:46:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 787. [2020-02-10 19:46:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:46:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-02-10 19:46:18,285 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-02-10 19:46:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,285 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-02-10 19:46:18,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-02-10 19:46:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:18,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:18,287 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash 256285179, now seen corresponding path program 251 times [2020-02-10 19:46:18,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284619970] [2020-02-10 19:46:18,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:18,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284619970] [2020-02-10 19:46:18,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:18,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439933462] [2020-02-10 19:46:18,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:18,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:18,674 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:46:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,810 INFO L93 Difference]: Finished difference Result 1391 states and 4899 transitions. [2020-02-10 19:46:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:18,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,814 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 19:46:18,814 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:46:18,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:46:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-02-10 19:46:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:46:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-02-10 19:46:18,837 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-02-10 19:46:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,837 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-02-10 19:46:18,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-02-10 19:46:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:18,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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] [2020-02-10 19:46:18,838 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash 794140757, now seen corresponding path program 252 times [2020-02-10 19:46:18,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90320540] [2020-02-10 19:46:18,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:19,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90320540] [2020-02-10 19:46:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:19,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444073305] [2020-02-10 19:46:19,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:19,238 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:46:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,404 INFO L93 Difference]: Finished difference Result 1390 states and 4892 transitions. [2020-02-10 19:46:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:19,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,408 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:46:19,408 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 19:46:19,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 19:46:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-02-10 19:46:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:46:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3135 transitions. [2020-02-10 19:46:19,432 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3135 transitions. Word has length 25 [2020-02-10 19:46:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,433 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3135 transitions. [2020-02-10 19:46:19,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3135 transitions. [2020-02-10 19:46:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:19,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:19,434 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -200235717, now seen corresponding path program 253 times [2020-02-10 19:46:19,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459469575] [2020-02-10 19:46:19,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:19,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459469575] [2020-02-10 19:46:19,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:19,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242757209] [2020-02-10 19:46:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:19,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:19,829 INFO L87 Difference]: Start difference. First operand 783 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:46:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,965 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-02-10 19:46:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:19,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,969 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:46:19,969 INFO L226 Difference]: Without dead ends: 1363 [2020-02-10 19:46:19,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-02-10 19:46:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 789. [2020-02-10 19:46:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 19:46:19,992 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 19:46:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,992 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 19:46:19,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 19:46:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:19,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:19,994 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:19,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash 780519001, now seen corresponding path program 254 times [2020-02-10 19:46:19,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751646502] [2020-02-10 19:46:19,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:20,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751646502] [2020-02-10 19:46:20,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:20,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819943174] [2020-02-10 19:46:20,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:20,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:20,377 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:46:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,516 INFO L93 Difference]: Finished difference Result 1375 states and 4862 transitions. [2020-02-10 19:46:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:20,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,520 INFO L225 Difference]: With dead ends: 1375 [2020-02-10 19:46:20,520 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 19:46:20,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 19:46:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-02-10 19:46:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:46:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3143 transitions. [2020-02-10 19:46:20,542 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3143 transitions. Word has length 25 [2020-02-10 19:46:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,543 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3143 transitions. [2020-02-10 19:46:20,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3143 transitions. [2020-02-10 19:46:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:20,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:20,544 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash -643134857, now seen corresponding path program 255 times [2020-02-10 19:46:20,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681520056] [2020-02-10 19:46:20,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:20,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681520056] [2020-02-10 19:46:20,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:20,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139034822] [2020-02-10 19:46:20,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:20,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:20,953 INFO L87 Difference]: Start difference. First operand 786 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:46:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,096 INFO L93 Difference]: Finished difference Result 1379 states and 4871 transitions. [2020-02-10 19:46:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:21,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,100 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 19:46:21,100 INFO L226 Difference]: Without dead ends: 1366 [2020-02-10 19:46:21,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-02-10 19:46:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 790. [2020-02-10 19:46:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 19:46:21,123 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,123 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 19:46:21,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 19:46:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:21,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:21,124 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,125 INFO L82 PathProgramCache]: Analyzing trace with hash 358626069, now seen corresponding path program 256 times [2020-02-10 19:46:21,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003638143] [2020-02-10 19:46:21,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:21,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003638143] [2020-02-10 19:46:21,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:21,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140499607] [2020-02-10 19:46:21,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:21,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:21,621 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,765 INFO L93 Difference]: Finished difference Result 1380 states and 4869 transitions. [2020-02-10 19:46:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:21,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,768 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 19:46:21,769 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 19:46:21,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 19:46:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 786. [2020-02-10 19:46:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:46:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-02-10 19:46:21,791 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-02-10 19:46:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,791 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-02-10 19:46:21,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-02-10 19:46:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:21,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,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] [2020-02-10 19:46:21,792 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1770336635, now seen corresponding path program 257 times [2020-02-10 19:46:21,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94706501] [2020-02-10 19:46:21,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:22,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94706501] [2020-02-10 19:46:22,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:22,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109813926] [2020-02-10 19:46:22,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:22,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:22,174 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:46:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,324 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-02-10 19:46:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:22,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,328 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 19:46:22,328 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 19:46:22,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 19:46:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-02-10 19:46:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-02-10 19:46:22,351 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-02-10 19:46:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,351 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-02-10 19:46:22,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-02-10 19:46:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:22,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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] [2020-02-10 19:46:22,353 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 697251255, now seen corresponding path program 258 times [2020-02-10 19:46:22,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867407682] [2020-02-10 19:46:22,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,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 19:46:22,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867407682] [2020-02-10 19:46:22,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:22,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792621100] [2020-02-10 19:46:22,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:22,737 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:46:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,877 INFO L93 Difference]: Finished difference Result 1378 states and 4862 transitions. [2020-02-10 19:46:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:22,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,881 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 19:46:22,881 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:46:22,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:46:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 783. [2020-02-10 19:46:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:46:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-02-10 19:46:22,904 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-02-10 19:46:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,904 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-02-10 19:46:22,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-02-10 19:46:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:22,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:22,906 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1069639765, now seen corresponding path program 259 times [2020-02-10 19:46:22,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245041250] [2020-02-10 19:46:22,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,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 19:46:23,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245041250] [2020-02-10 19:46:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:23,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533329007] [2020-02-10 19:46:23,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:23,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:23,318 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:46:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,453 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-02-10 19:46:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:23,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,457 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 19:46:23,457 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:46:23,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:46:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 789. [2020-02-10 19:46:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 19:46:23,480 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 19:46:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,480 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 19:46:23,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 19:46:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:23,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:23,481 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1614386573, now seen corresponding path program 260 times [2020-02-10 19:46:23,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679203976] [2020-02-10 19:46:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:23,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679203976] [2020-02-10 19:46:23,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:23,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516205291] [2020-02-10 19:46:23,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:23,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:23,889 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:46:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,031 INFO L93 Difference]: Finished difference Result 1380 states and 4870 transitions. [2020-02-10 19:46:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:24,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,035 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 19:46:24,035 INFO L226 Difference]: Without dead ends: 1365 [2020-02-10 19:46:24,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-02-10 19:46:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 786. [2020-02-10 19:46:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:46:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-02-10 19:46:24,058 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-02-10 19:46:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,059 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-02-10 19:46:24,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-02-10 19:46:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:24,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:24,060 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2131235943, now seen corresponding path program 261 times [2020-02-10 19:46:24,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262256289] [2020-02-10 19:46:24,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:24,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262256289] [2020-02-10 19:46:24,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:24,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470562550] [2020-02-10 19:46:24,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:24,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:24,445 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:46:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,589 INFO L93 Difference]: Finished difference Result 1387 states and 4886 transitions. [2020-02-10 19:46:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:24,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,592 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:46:24,592 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 19:46:24,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 19:46:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 19:46:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-02-10 19:46:24,615 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-02-10 19:46:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,615 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-02-10 19:46:24,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-02-10 19:46:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:24,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:24,616 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1593380365, now seen corresponding path program 262 times [2020-02-10 19:46:24,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037309949] [2020-02-10 19:46:24,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:24,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037309949] [2020-02-10 19:46:24,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:24,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053933929] [2020-02-10 19:46:24,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:24,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:24,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:24,998 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:46:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,138 INFO L93 Difference]: Finished difference Result 1386 states and 4879 transitions. [2020-02-10 19:46:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:25,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,142 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 19:46:25,142 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 19:46:25,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 19:46:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 786. [2020-02-10 19:46:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:46:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-02-10 19:46:25,166 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-02-10 19:46:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,166 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-02-10 19:46:25,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-02-10 19:46:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:25,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:25,168 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2120732839, now seen corresponding path program 263 times [2020-02-10 19:46:25,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745449360] [2020-02-10 19:46:25,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:25,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745449360] [2020-02-10 19:46:25,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:25,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683474224] [2020-02-10 19:46:25,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:25,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:25,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:25,545 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:46:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,696 INFO L93 Difference]: Finished difference Result 1379 states and 4865 transitions. [2020-02-10 19:46:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:25,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,700 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 19:46:25,700 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 19:46:25,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 19:46:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 789. [2020-02-10 19:46:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-02-10 19:46:25,724 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-02-10 19:46:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,724 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-02-10 19:46:25,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-02-10 19:46:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:25,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,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] [2020-02-10 19:46:25,725 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1101149077, now seen corresponding path program 264 times [2020-02-10 19:46:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861521721] [2020-02-10 19:46:25,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:26,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861521721] [2020-02-10 19:46:26,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:26,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550899716] [2020-02-10 19:46:26,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:26,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:26,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:26,099 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:46:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,232 INFO L93 Difference]: Finished difference Result 1381 states and 4866 transitions. [2020-02-10 19:46:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:26,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,236 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 19:46:26,236 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 19:46:26,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 19:46:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 780. [2020-02-10 19:46:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:46:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3124 transitions. [2020-02-10 19:46:26,262 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3124 transitions. Word has length 25 [2020-02-10 19:46:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,262 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3124 transitions. [2020-02-10 19:46:26,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3124 transitions. [2020-02-10 19:46:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:26,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,263 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1070968235, now seen corresponding path program 265 times [2020-02-10 19:46:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568093302] [2020-02-10 19:46:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:26,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568093302] [2020-02-10 19:46:26,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:26,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127051580] [2020-02-10 19:46:26,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:26,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:26,646 INFO L87 Difference]: Start difference. First operand 780 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:46:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,811 INFO L93 Difference]: Finished difference Result 1393 states and 4910 transitions. [2020-02-10 19:46:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:26,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,815 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 19:46:26,815 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:46:26,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:46:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-02-10 19:46:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-02-10 19:46:26,838 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-02-10 19:46:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,838 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-02-10 19:46:26,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-02-10 19:46:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:26,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,839 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash -100716621, now seen corresponding path program 266 times [2020-02-10 19:46:26,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567157841] [2020-02-10 19:46:26,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:27,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567157841] [2020-02-10 19:46:27,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:27,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461656653] [2020-02-10 19:46:27,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:27,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:27,218 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:46:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,365 INFO L93 Difference]: Finished difference Result 1395 states and 4910 transitions. [2020-02-10 19:46:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:27,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,369 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:46:27,369 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:46:27,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:46:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-02-10 19:46:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:46:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3150 transitions. [2020-02-10 19:46:27,392 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:27,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,392 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3150 transitions. [2020-02-10 19:46:27,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3150 transitions. [2020-02-10 19:46:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:27,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:27,394 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,394 INFO L82 PathProgramCache]: Analyzing trace with hash 855065843, now seen corresponding path program 267 times [2020-02-10 19:46:27,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124741704] [2020-02-10 19:46:27,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:27,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124741704] [2020-02-10 19:46:27,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:27,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867414949] [2020-02-10 19:46:27,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:27,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:27,794 INFO L87 Difference]: Start difference. First operand 787 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,941 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 19:46:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:27,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,945 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:46:27,945 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:46:27,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:46:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-02-10 19:46:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 19:46:27,967 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 19:46:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,968 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 19:46:27,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 19:46:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:27,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:27,969 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1835820561, now seen corresponding path program 268 times [2020-02-10 19:46:27,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339267050] [2020-02-10 19:46:27,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:28,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339267050] [2020-02-10 19:46:28,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:28,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776599424] [2020-02-10 19:46:28,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:28,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:28,371 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:46:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,511 INFO L93 Difference]: Finished difference Result 1388 states and 4893 transitions. [2020-02-10 19:46:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:28,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,515 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:46:28,516 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:46:28,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:46:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 19:46:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:46:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 19:46:28,539 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 19:46:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,539 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 19:46:28,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 19:46:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:28,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:28,540 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash 237908565, now seen corresponding path program 269 times [2020-02-10 19:46:28,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702998716] [2020-02-10 19:46:28,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:28,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702998716] [2020-02-10 19:46:28,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:28,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404812724] [2020-02-10 19:46:28,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:28,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:28,941 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:46:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,089 INFO L93 Difference]: Finished difference Result 1393 states and 4903 transitions. [2020-02-10 19:46:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:29,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,092 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 19:46:29,092 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 19:46:29,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 19:46:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 790. [2020-02-10 19:46:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-02-10 19:46:29,116 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-02-10 19:46:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,117 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-02-10 19:46:29,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-02-10 19:46:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:29,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,118 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849523, now seen corresponding path program 270 times [2020-02-10 19:46:29,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668590907] [2020-02-10 19:46:29,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:29,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668590907] [2020-02-10 19:46:29,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:29,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128087675] [2020-02-10 19:46:29,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:29,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:29,496 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:46:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,660 INFO L93 Difference]: Finished difference Result 1390 states and 4894 transitions. [2020-02-10 19:46:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:29,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,664 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:46:29,664 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 19:46:29,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 19:46:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 784. [2020-02-10 19:46:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:46:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3139 transitions. [2020-02-10 19:46:29,686 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3139 transitions. Word has length 25 [2020-02-10 19:46:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,686 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3139 transitions. [2020-02-10 19:46:29,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3139 transitions. [2020-02-10 19:46:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:29,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:29,688 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1956541883, now seen corresponding path program 271 times [2020-02-10 19:46:29,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456069418] [2020-02-10 19:46:29,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:30,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456069418] [2020-02-10 19:46:30,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:30,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768451768] [2020-02-10 19:46:30,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:30,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:30,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:30,058 INFO L87 Difference]: Start difference. First operand 784 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:46:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,195 INFO L93 Difference]: Finished difference Result 1407 states and 4941 transitions. [2020-02-10 19:46:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:30,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,199 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:46:30,199 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:46:30,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:46:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 793. [2020-02-10 19:46:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-02-10 19:46:30,221 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-02-10 19:46:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,222 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-02-10 19:46:30,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-02-10 19:46:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:30,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:30,223 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173799, now seen corresponding path program 272 times [2020-02-10 19:46:30,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908053587] [2020-02-10 19:46:30,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,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 19:46:30,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908053587] [2020-02-10 19:46:30,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:30,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221091143] [2020-02-10 19:46:30,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:30,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:30,602 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:46:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,763 INFO L93 Difference]: Finished difference Result 1409 states and 4941 transitions. [2020-02-10 19:46:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:30,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,767 INFO L225 Difference]: With dead ends: 1409 [2020-02-10 19:46:30,767 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:46:30,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:46:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 19:46:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3153 transitions. [2020-02-10 19:46:30,789 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3153 transitions. Word has length 25 [2020-02-10 19:46:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,789 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3153 transitions. [2020-02-10 19:46:30,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3153 transitions. [2020-02-10 19:46:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:30,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:30,791 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1070743603, now seen corresponding path program 273 times [2020-02-10 19:46:30,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818808454] [2020-02-10 19:46:30,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:31,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818808454] [2020-02-10 19:46:31,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:31,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185589953] [2020-02-10 19:46:31,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:31,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:31,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:31,179 INFO L87 Difference]: Start difference. First operand 789 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:46:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,361 INFO L93 Difference]: Finished difference Result 1411 states and 4944 transitions. [2020-02-10 19:46:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:31,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,364 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:46:31,364 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:46:31,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:46:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 19:46:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:46:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 19:46:31,403 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 19:46:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,404 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 19:46:31,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 19:46:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:31,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:31,405 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2083007633, now seen corresponding path program 274 times [2020-02-10 19:46:31,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408085554] [2020-02-10 19:46:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:31,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408085554] [2020-02-10 19:46:31,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:31,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42253260] [2020-02-10 19:46:31,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:31,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:31,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:31,802 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:46:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,953 INFO L93 Difference]: Finished difference Result 1416 states and 4949 transitions. [2020-02-10 19:46:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:31,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,956 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:46:31,956 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:46:31,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:46:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 19:46:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 19:46:31,980 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 19:46:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,980 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 19:46:31,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 19:46:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:31,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:31,981 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -52759941, now seen corresponding path program 275 times [2020-02-10 19:46:31,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828627325] [2020-02-10 19:46:31,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:32,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828627325] [2020-02-10 19:46:32,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:32,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286028004] [2020-02-10 19:46:32,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:32,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:32,370 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:46:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,524 INFO L93 Difference]: Finished difference Result 1417 states and 4953 transitions. [2020-02-10 19:46:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:32,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,528 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:46:32,529 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:46:32,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:46:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 796. [2020-02-10 19:46:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:46:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3161 transitions. [2020-02-10 19:46:32,555 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3161 transitions. Word has length 25 [2020-02-10 19:46:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,555 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3161 transitions. [2020-02-10 19:46:32,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3161 transitions. [2020-02-10 19:46:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:32,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:32,557 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2096036595, now seen corresponding path program 276 times [2020-02-10 19:46:32,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482933714] [2020-02-10 19:46:32,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:32,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482933714] [2020-02-10 19:46:32,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:32,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369302013] [2020-02-10 19:46:32,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:32,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:32,944 INFO L87 Difference]: Start difference. First operand 796 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:46:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,065 INFO L93 Difference]: Finished difference Result 1420 states and 4952 transitions. [2020-02-10 19:46:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:33,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,069 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 19:46:33,069 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:46:33,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:46:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 784. [2020-02-10 19:46:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:46:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3135 transitions. [2020-02-10 19:46:33,092 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3135 transitions. Word has length 25 [2020-02-10 19:46:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,092 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3135 transitions. [2020-02-10 19:46:33,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3135 transitions. [2020-02-10 19:46:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:33,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,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] [2020-02-10 19:46:33,094 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -834877061, now seen corresponding path program 277 times [2020-02-10 19:46:33,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187864417] [2020-02-10 19:46:33,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:33,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187864417] [2020-02-10 19:46:33,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:33,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538722989] [2020-02-10 19:46:33,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:33,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:33,472 INFO L87 Difference]: Start difference. First operand 784 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:46:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,632 INFO L93 Difference]: Finished difference Result 1395 states and 4906 transitions. [2020-02-10 19:46:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:33,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,636 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:46:33,636 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 19:46:33,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 19:46:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 791. [2020-02-10 19:46:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-02-10 19:46:33,660 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-02-10 19:46:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,660 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-02-10 19:46:33,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-02-10 19:46:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:33,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:33,662 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 145877657, now seen corresponding path program 278 times [2020-02-10 19:46:33,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024561654] [2020-02-10 19:46:33,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,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 19:46:34,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024561654] [2020-02-10 19:46:34,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:34,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250695610] [2020-02-10 19:46:34,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:34,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:34,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:34,036 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:46:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,212 INFO L93 Difference]: Finished difference Result 1394 states and 4901 transitions. [2020-02-10 19:46:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:34,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,215 INFO L225 Difference]: With dead ends: 1394 [2020-02-10 19:46:34,215 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 19:46:34,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 19:46:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 788. [2020-02-10 19:46:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 19:46:34,237 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 19:46:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,238 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 19:46:34,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 19:46:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:34,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:34,239 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 648257877, now seen corresponding path program 279 times [2020-02-10 19:46:34,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196306875] [2020-02-10 19:46:34,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:34,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196306875] [2020-02-10 19:46:34,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:34,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629764207] [2020-02-10 19:46:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:34,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:34,613 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:46:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,759 INFO L93 Difference]: Finished difference Result 1403 states and 4919 transitions. [2020-02-10 19:46:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:34,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,763 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:46:34,763 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:46:34,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:46:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 793. [2020-02-10 19:46:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-02-10 19:46:34,787 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-02-10 19:46:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,787 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-02-10 19:46:34,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-02-10 19:46:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:34,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:34,788 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1660521907, now seen corresponding path program 280 times [2020-02-10 19:46:34,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46938802] [2020-02-10 19:46:34,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:35,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46938802] [2020-02-10 19:46:35,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:35,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479426328] [2020-02-10 19:46:35,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:35,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:35,179 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:46:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,319 INFO L93 Difference]: Finished difference Result 1408 states and 4924 transitions. [2020-02-10 19:46:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:35,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,323 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 19:46:35,323 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:46:35,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:46:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 19:46:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 19:46:35,346 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 19:46:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,346 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 19:46:35,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 19:46:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:35,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:35,347 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1461291515, now seen corresponding path program 281 times [2020-02-10 19:46:35,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737864854] [2020-02-10 19:46:35,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:35,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737864854] [2020-02-10 19:46:35,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:35,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426289627] [2020-02-10 19:46:35,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:35,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:35,755 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:46:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,925 INFO L93 Difference]: Finished difference Result 1400 states and 4908 transitions. [2020-02-10 19:46:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:35,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,929 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 19:46:35,929 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:46:35,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:46:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 19:46:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:46:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 19:46:35,952 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 19:46:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,953 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 19:46:35,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 19:46:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:35,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:35,954 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1999147093, now seen corresponding path program 282 times [2020-02-10 19:46:35,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981287416] [2020-02-10 19:46:35,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,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 19:46:36,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981287416] [2020-02-10 19:46:36,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:36,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032687807] [2020-02-10 19:46:36,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:36,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:36,351 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:46:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,469 INFO L93 Difference]: Finished difference Result 1406 states and 4916 transitions. [2020-02-10 19:46:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:36,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,473 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:46:36,473 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:46:36,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:46:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-02-10 19:46:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:46:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-02-10 19:46:36,496 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-02-10 19:46:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,496 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-02-10 19:46:36,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-02-10 19:46:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:36,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,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] [2020-02-10 19:46:36,497 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:36,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1933934797, now seen corresponding path program 283 times [2020-02-10 19:46:36,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494629045] [2020-02-10 19:46:36,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:36,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494629045] [2020-02-10 19:46:36,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:36,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488251207] [2020-02-10 19:46:36,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:36,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:36,880 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-02-10 19:46:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,043 INFO L93 Difference]: Finished difference Result 1403 states and 4920 transitions. [2020-02-10 19:46:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:37,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,047 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:46:37,047 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:46:37,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:46:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 791. [2020-02-10 19:46:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 19:46:37,070 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,070 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 19:46:37,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 19:46:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:37,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:37,072 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -322993839, now seen corresponding path program 284 times [2020-02-10 19:46:37,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648007929] [2020-02-10 19:46:37,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,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 19:46:37,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648007929] [2020-02-10 19:46:37,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:37,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414308089] [2020-02-10 19:46:37,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:37,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:37,461 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,612 INFO L93 Difference]: Finished difference Result 1400 states and 4911 transitions. [2020-02-10 19:46:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:37,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,616 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 19:46:37,616 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:46:37,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:46:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 19:46:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 19:46:37,638 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 19:46:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,638 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 19:46:37,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 19:46:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:37,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,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] [2020-02-10 19:46:37,640 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1854686233, now seen corresponding path program 285 times [2020-02-10 19:46:37,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784693675] [2020-02-10 19:46:37,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:38,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784693675] [2020-02-10 19:46:38,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:38,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383676531] [2020-02-10 19:46:38,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:38,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:38,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:38,024 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:46:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,173 INFO L93 Difference]: Finished difference Result 1413 states and 4939 transitions. [2020-02-10 19:46:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:38,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,177 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:46:38,177 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:46:38,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:46:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 795. [2020-02-10 19:46:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:46:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 19:46:38,200 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 19:46:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,200 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 19:46:38,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 19:46:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:38,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:38,201 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -291484527, now seen corresponding path program 286 times [2020-02-10 19:46:38,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818663839] [2020-02-10 19:46:38,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:38,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818663839] [2020-02-10 19:46:38,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:38,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706520238] [2020-02-10 19:46:38,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:38,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:38,591 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:46:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,700 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-02-10 19:46:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:38,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,704 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:46:38,704 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 19:46:38,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 19:46:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 788. [2020-02-10 19:46:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 19:46:38,729 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 19:46:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,730 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 19:46:38,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 19:46:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:38,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,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] [2020-02-10 19:46:38,731 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1865189337, now seen corresponding path program 287 times [2020-02-10 19:46:38,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514669250] [2020-02-10 19:46:38,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:39,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514669250] [2020-02-10 19:46:39,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:39,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926427890] [2020-02-10 19:46:39,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:39,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:39,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:39,127 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:46:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,302 INFO L93 Difference]: Finished difference Result 1404 states and 4914 transitions. [2020-02-10 19:46:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:39,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,307 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 19:46:39,307 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 19:46:39,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 19:46:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 792. [2020-02-10 19:46:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:46:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 19:46:39,336 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 19:46:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,337 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 19:46:39,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 19:46:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:39,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:39,339 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922381, now seen corresponding path program 288 times [2020-02-10 19:46:39,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271199520] [2020-02-10 19:46:39,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,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 19:46:39,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271199520] [2020-02-10 19:46:39,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:39,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383358668] [2020-02-10 19:46:39,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:39,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:39,735 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:46:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,878 INFO L93 Difference]: Finished difference Result 1410 states and 4922 transitions. [2020-02-10 19:46:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:39,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,882 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 19:46:39,882 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:46:39,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:46:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 780. [2020-02-10 19:46:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:46:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3120 transitions. [2020-02-10 19:46:39,904 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3120 transitions. Word has length 25 [2020-02-10 19:46:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,904 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3120 transitions. [2020-02-10 19:46:39,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3120 transitions. [2020-02-10 19:46:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:39,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:39,906 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1954716373, now seen corresponding path program 289 times [2020-02-10 19:46:39,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838975009] [2020-02-10 19:46:39,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:40,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838975009] [2020-02-10 19:46:40,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:40,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121141553] [2020-02-10 19:46:40,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:40,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:40,298 INFO L87 Difference]: Start difference. First operand 780 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:46:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,462 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-02-10 19:46:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:40,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,466 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:46:40,467 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:46:40,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:46:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 19:46:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 19:46:40,490 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 19:46:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,491 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 19:46:40,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 19:46:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:40,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:40,492 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1369999309, now seen corresponding path program 290 times [2020-02-10 19:46:40,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349985894] [2020-02-10 19:46:40,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:40,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349985894] [2020-02-10 19:46:40,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:40,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100805349] [2020-02-10 19:46:40,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:40,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:40,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:40,875 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:46:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,045 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-02-10 19:46:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:41,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,049 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:46:41,049 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:46:41,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:46:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 19:46:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 19:46:41,072 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 19:46:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,072 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 19:46:41,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 19:46:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:41,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:41,074 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash -857115985, now seen corresponding path program 291 times [2020-02-10 19:46:41,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68336267] [2020-02-10 19:46:41,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:41,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68336267] [2020-02-10 19:46:41,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:41,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215969159] [2020-02-10 19:46:41,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:41,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:41,458 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:46:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,622 INFO L93 Difference]: Finished difference Result 1410 states and 4957 transitions. [2020-02-10 19:46:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:41,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,626 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 19:46:41,626 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 19:46:41,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 19:46:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 793. [2020-02-10 19:46:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 19:46:41,648 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 19:46:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,648 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 19:46:41,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 19:46:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:41,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:41,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] [2020-02-10 19:46:41,650 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash 144644941, now seen corresponding path program 292 times [2020-02-10 19:46:41,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590667425] [2020-02-10 19:46:41,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:42,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590667425] [2020-02-10 19:46:42,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:42,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764494662] [2020-02-10 19:46:42,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:42,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:42,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:42,035 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:46:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,202 INFO L93 Difference]: Finished difference Result 1411 states and 4955 transitions. [2020-02-10 19:46:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:42,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,207 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:46:42,207 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:46:42,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:46:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 19:46:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:46:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-02-10 19:46:42,229 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,230 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-02-10 19:46:42,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-02-10 19:46:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:42,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:42,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:42,231 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash -380181675, now seen corresponding path program 293 times [2020-02-10 19:46:42,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028405311] [2020-02-10 19:46:42,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:42,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028405311] [2020-02-10 19:46:42,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:42,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062555756] [2020-02-10 19:46:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:42,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:42,624 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,789 INFO L93 Difference]: Finished difference Result 1415 states and 4964 transitions. [2020-02-10 19:46:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:42,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,793 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 19:46:42,793 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 19:46:42,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 19:46:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 794. [2020-02-10 19:46:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:46:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-02-10 19:46:42,836 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-02-10 19:46:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,836 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-02-10 19:46:42,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-02-10 19:46:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:42,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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] [2020-02-10 19:46:42,838 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash 157673903, now seen corresponding path program 294 times [2020-02-10 19:46:42,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647610757] [2020-02-10 19:46:42,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:43,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647610757] [2020-02-10 19:46:43,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:43,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443706798] [2020-02-10 19:46:43,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:43,231 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:46:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,394 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-02-10 19:46:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:43,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,398 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:46:43,398 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 19:46:43,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 19:46:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 785. [2020-02-10 19:46:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:46:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3139 transitions. [2020-02-10 19:46:43,420 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3139 transitions. Word has length 25 [2020-02-10 19:46:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,421 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3139 transitions. [2020-02-10 19:46:43,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3139 transitions. [2020-02-10 19:46:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:43,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:43,422 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1532230647, now seen corresponding path program 295 times [2020-02-10 19:46:43,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897881218] [2020-02-10 19:46:43,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:43,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897881218] [2020-02-10 19:46:43,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:43,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745580406] [2020-02-10 19:46:43,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:43,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:43,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:43,797 INFO L87 Difference]: Start difference. First operand 785 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:46:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,958 INFO L93 Difference]: Finished difference Result 1419 states and 4976 transitions. [2020-02-10 19:46:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:43,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,962 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:46:43,962 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:46:43,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:46:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 19:46:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:46:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 19:46:43,985 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 19:46:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,985 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 19:46:43,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 19:46:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:43,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,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] [2020-02-10 19:46:43,986 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1792485035, now seen corresponding path program 296 times [2020-02-10 19:46:43,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906372536] [2020-02-10 19:46:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:44,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906372536] [2020-02-10 19:46:44,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:44,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028170525] [2020-02-10 19:46:44,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:44,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:44,377 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:46:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,534 INFO L93 Difference]: Finished difference Result 1421 states and 4976 transitions. [2020-02-10 19:46:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:44,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,538 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:46:44,538 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:46:44,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:46:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 19:46:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-02-10 19:46:44,561 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-02-10 19:46:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,561 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-02-10 19:46:44,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-02-10 19:46:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:44,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:44,562 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash 646432367, now seen corresponding path program 297 times [2020-02-10 19:46:44,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716285459] [2020-02-10 19:46:44,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,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 19:46:44,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716285459] [2020-02-10 19:46:44,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:44,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253519583] [2020-02-10 19:46:44,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:44,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:44,943 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:46:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,105 INFO L93 Difference]: Finished difference Result 1423 states and 4979 transitions. [2020-02-10 19:46:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:45,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,109 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 19:46:45,109 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:46:45,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:46:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 795. [2020-02-10 19:46:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:46:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3162 transitions. [2020-02-10 19:46:45,132 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3162 transitions. Word has length 25 [2020-02-10 19:46:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,132 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3162 transitions. [2020-02-10 19:46:45,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3162 transitions. [2020-02-10 19:46:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:45,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:45,133 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1658696397, now seen corresponding path program 298 times [2020-02-10 19:46:45,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084161158] [2020-02-10 19:46:45,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:45,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084161158] [2020-02-10 19:46:45,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:45,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430421243] [2020-02-10 19:46:45,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:45,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:45,526 INFO L87 Difference]: Start difference. First operand 795 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:46:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,661 INFO L93 Difference]: Finished difference Result 1428 states and 4984 transitions. [2020-02-10 19:46:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:45,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,665 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:46:45,665 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 19:46:45,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 19:46:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 790. [2020-02-10 19:46:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 19:46:45,688 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 19:46:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,688 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 19:46:45,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 19:46:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:45,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:45,689 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:45,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash -477071177, now seen corresponding path program 299 times [2020-02-10 19:46:45,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987945929] [2020-02-10 19:46:45,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:46,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987945929] [2020-02-10 19:46:46,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:46,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79731298] [2020-02-10 19:46:46,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:46,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:46,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:46,073 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:46:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,218 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 19:46:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:46,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,222 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:46:46,223 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:46:46,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:46:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 797. [2020-02-10 19:46:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:46:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 19:46:46,245 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 19:46:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,245 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 19:46:46,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 19:46:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:46,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,247 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1671725359, now seen corresponding path program 300 times [2020-02-10 19:46:46,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553956290] [2020-02-10 19:46:46,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:46,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553956290] [2020-02-10 19:46:46,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:46,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711258222] [2020-02-10 19:46:46,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:46,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:46,633 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:46:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,754 INFO L93 Difference]: Finished difference Result 1432 states and 4987 transitions. [2020-02-10 19:46:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:46,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,758 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:46:46,758 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:46:46,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:46:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 785. [2020-02-10 19:46:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:46:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3134 transitions. [2020-02-10 19:46:46,781 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3134 transitions. Word has length 25 [2020-02-10 19:46:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,781 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3134 transitions. [2020-02-10 19:46:46,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3134 transitions. [2020-02-10 19:46:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:46,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,782 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1747908407, now seen corresponding path program 301 times [2020-02-10 19:46:46,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464924028] [2020-02-10 19:46:46,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:47,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464924028] [2020-02-10 19:46:47,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:47,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900676732] [2020-02-10 19:46:47,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:47,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:47,183 INFO L87 Difference]: Start difference. First operand 785 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:46:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,346 INFO L93 Difference]: Finished difference Result 1416 states and 4964 transitions. [2020-02-10 19:46:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:47,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,350 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:46:47,350 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:46:47,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:46:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 794. [2020-02-10 19:46:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:46:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-02-10 19:46:47,373 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-02-10 19:46:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,373 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-02-10 19:46:47,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-02-10 19:46:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:47,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:47,375 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1545297963, now seen corresponding path program 302 times [2020-02-10 19:46:47,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370906264] [2020-02-10 19:46:47,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:47,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370906264] [2020-02-10 19:46:47,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:47,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368513534] [2020-02-10 19:46:47,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:47,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:47,755 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:46:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,889 INFO L93 Difference]: Finished difference Result 1417 states and 4962 transitions. [2020-02-10 19:46:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:47,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,894 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:46:47,894 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:46:47,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:46:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 19:46:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 19:46:47,917 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 19:46:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,917 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 19:46:47,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 19:46:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:47,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,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] [2020-02-10 19:46:47,918 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -621024811, now seen corresponding path program 303 times [2020-02-10 19:46:47,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075101354] [2020-02-10 19:46:47,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:48,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075101354] [2020-02-10 19:46:48,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:48,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684246943] [2020-02-10 19:46:48,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:48,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:48,298 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:46:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,430 INFO L93 Difference]: Finished difference Result 1421 states and 4969 transitions. [2020-02-10 19:46:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:48,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,433 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:46:48,433 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 19:46:48,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 19:46:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-02-10 19:46:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:46:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-02-10 19:46:48,456 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-02-10 19:46:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,457 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-02-10 19:46:48,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-02-10 19:46:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:48,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:48,458 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 391239219, now seen corresponding path program 304 times [2020-02-10 19:46:48,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737413109] [2020-02-10 19:46:48,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46: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 19:46:48,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737413109] [2020-02-10 19:46:48,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:48,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046199312] [2020-02-10 19:46:48,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:48,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:48,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:48,867 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:46:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,986 INFO L93 Difference]: Finished difference Result 1426 states and 4974 transitions. [2020-02-10 19:46:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:48,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,990 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 19:46:48,990 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:46:48,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:46:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 19:46:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-02-10 19:46:49,013 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-02-10 19:46:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,013 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-02-10 19:46:49,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-02-10 19:46:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:49,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:49,014 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash -229884105, now seen corresponding path program 305 times [2020-02-10 19:46:49,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236700246] [2020-02-10 19:46:49,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:49,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236700246] [2020-02-10 19:46:49,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:49,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287219972] [2020-02-10 19:46:49,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:49,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:49,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:49,396 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:46:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,582 INFO L93 Difference]: Finished difference Result 1424 states and 4971 transitions. [2020-02-10 19:46:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:49,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,586 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:46:49,587 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:46:49,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:46:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 796. [2020-02-10 19:46:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:46:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-02-10 19:46:49,610 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-02-10 19:46:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,611 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-02-10 19:46:49,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-02-10 19:46:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:49,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:49,612 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1381056853, now seen corresponding path program 306 times [2020-02-10 19:46:49,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453659132] [2020-02-10 19:46:49,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:50,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453659132] [2020-02-10 19:46:50,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:50,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457395480] [2020-02-10 19:46:50,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:50,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:50,006 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:46:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,144 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 19:46:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:50,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,149 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:46:50,149 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:46:50,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:46:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 785. [2020-02-10 19:46:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:46:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-02-10 19:46:50,172 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-02-10 19:46:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,172 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-02-10 19:46:50,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-02-10 19:46:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:50,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:50,173 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1742942259, now seen corresponding path program 307 times [2020-02-10 19:46:50,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965741816] [2020-02-10 19:46:50,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:50,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965741816] [2020-02-10 19:46:50,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:50,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002547106] [2020-02-10 19:46:50,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:50,565 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:46:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,708 INFO L93 Difference]: Finished difference Result 1427 states and 4987 transitions. [2020-02-10 19:46:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:50,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,712 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 19:46:50,712 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:46:50,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:46:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 796. [2020-02-10 19:46:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:46:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3160 transitions. [2020-02-10 19:46:50,735 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3160 transitions. Word has length 25 [2020-02-10 19:46:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,735 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3160 transitions. [2020-02-10 19:46:50,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3160 transitions. [2020-02-10 19:46:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:50,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:50,736 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2014169459, now seen corresponding path program 308 times [2020-02-10 19:46:50,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960411645] [2020-02-10 19:46:50,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:51,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960411645] [2020-02-10 19:46:51,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:51,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032072066] [2020-02-10 19:46:51,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:51,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:51,120 INFO L87 Difference]: Start difference. First operand 796 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:46:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,306 INFO L93 Difference]: Finished difference Result 1426 states and 4980 transitions. [2020-02-10 19:46:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:51,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,310 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 19:46:51,310 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 19:46:51,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 19:46:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 791. [2020-02-10 19:46:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 19:46:51,333 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 19:46:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,333 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 19:46:51,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 19:46:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:51,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,334 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash 142504405, now seen corresponding path program 309 times [2020-02-10 19:46:51,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112985903] [2020-02-10 19:46:51,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:51,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112985903] [2020-02-10 19:46:51,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:51,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422444915] [2020-02-10 19:46:51,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:51,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:51,726 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:46:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,894 INFO L93 Difference]: Finished difference Result 1433 states and 4994 transitions. [2020-02-10 19:46:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:51,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,897 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 19:46:51,897 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:46:51,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:46:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 798. [2020-02-10 19:46:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:46:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3159 transitions. [2020-02-10 19:46:51,920 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3159 transitions. Word has length 25 [2020-02-10 19:46:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,920 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3159 transitions. [2020-02-10 19:46:51,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3159 transitions. [2020-02-10 19:46:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:51,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:51,921 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2003666355, now seen corresponding path program 310 times [2020-02-10 19:46:51,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018952638] [2020-02-10 19:46:51,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:52,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018952638] [2020-02-10 19:46:52,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:52,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720128050] [2020-02-10 19:46:52,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:52,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:52,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:52,317 INFO L87 Difference]: Start difference. First operand 798 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:46:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,479 INFO L93 Difference]: Finished difference Result 1436 states and 4993 transitions. [2020-02-10 19:46:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:52,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,484 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 19:46:52,484 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 19:46:52,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 19:46:52,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-02-10 19:46:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-02-10 19:46:52,507 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-02-10 19:46:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,507 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-02-10 19:46:52,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-02-10 19:46:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:52,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,508 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash 174013717, now seen corresponding path program 311 times [2020-02-10 19:46:52,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788100406] [2020-02-10 19:46:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:52,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788100406] [2020-02-10 19:46:52,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:52,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064181241] [2020-02-10 19:46:52,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:52,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:52,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:52,895 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:46:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,089 INFO L93 Difference]: Finished difference Result 1430 states and 4981 transitions. [2020-02-10 19:46:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:53,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,093 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 19:46:53,093 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:46:53,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:46:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-02-10 19:46:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:46:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3151 transitions. [2020-02-10 19:46:53,116 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3151 transitions. Word has length 25 [2020-02-10 19:46:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,116 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3151 transitions. [2020-02-10 19:46:53,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3151 transitions. [2020-02-10 19:46:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:53,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,118 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1784954675, now seen corresponding path program 312 times [2020-02-10 19:46:53,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493220107] [2020-02-10 19:46:53,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,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 19:46:53,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493220107] [2020-02-10 19:46:53,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:53,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52005966] [2020-02-10 19:46:53,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:53,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:53,503 INFO L87 Difference]: Start difference. First operand 797 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:46:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,664 INFO L93 Difference]: Finished difference Result 1434 states and 4983 transitions. [2020-02-10 19:46:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:53,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,668 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:46:53,668 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:46:53,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:46:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 780. [2020-02-10 19:46:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:46:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3116 transitions. [2020-02-10 19:46:53,690 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3116 transitions. Word has length 25 [2020-02-10 19:46:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,690 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3116 transitions. [2020-02-10 19:46:53,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3116 transitions. [2020-02-10 19:46:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:53,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,692 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1048858189, now seen corresponding path program 313 times [2020-02-10 19:46:53,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742984995] [2020-02-10 19:46:53,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:54,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742984995] [2020-02-10 19:46:54,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:54,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043263321] [2020-02-10 19:46:54,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:54,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:54,085 INFO L87 Difference]: Start difference. First operand 780 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:46:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,265 INFO L93 Difference]: Finished difference Result 1386 states and 4886 transitions. [2020-02-10 19:46:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:54,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,269 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 19:46:54,269 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:46:54,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:46:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 790. [2020-02-10 19:46:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 19:46:54,293 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,294 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 19:46:54,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 19:46:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:54,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:54,295 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -68103471, now seen corresponding path program 314 times [2020-02-10 19:46:54,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4712461] [2020-02-10 19:46:54,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:54,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4712461] [2020-02-10 19:46:54,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:54,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910433470] [2020-02-10 19:46:54,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:54,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:54,685 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,866 INFO L93 Difference]: Finished difference Result 1385 states and 4881 transitions. [2020-02-10 19:46:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:54,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,869 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 19:46:54,870 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 19:46:54,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 19:46:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 19:46:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:46:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3142 transitions. [2020-02-10 19:46:54,893 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3142 transitions. Word has length 25 [2020-02-10 19:46:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,893 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3142 transitions. [2020-02-10 19:46:54,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3142 transitions. [2020-02-10 19:46:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:54,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:54,894 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1491757329, now seen corresponding path program 315 times [2020-02-10 19:46:54,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672106246] [2020-02-10 19:46:54,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:55,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672106246] [2020-02-10 19:46:55,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:55,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520165699] [2020-02-10 19:46:55,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:55,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:55,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:55,277 INFO L87 Difference]: Start difference. First operand 787 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:46:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,414 INFO L93 Difference]: Finished difference Result 1389 states and 4890 transitions. [2020-02-10 19:46:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:55,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,418 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:46:55,419 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:46:55,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:46:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-02-10 19:46:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-02-10 19:46:55,441 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-02-10 19:46:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,441 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-02-10 19:46:55,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-02-10 19:46:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:55,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,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] [2020-02-10 19:46:55,442 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash -489996403, now seen corresponding path program 316 times [2020-02-10 19:46:55,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93805888] [2020-02-10 19:46:55,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,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 19:46:55,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93805888] [2020-02-10 19:46:55,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:55,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018544468] [2020-02-10 19:46:55,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:55,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:55,839 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:46:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,022 INFO L93 Difference]: Finished difference Result 1390 states and 4888 transitions. [2020-02-10 19:46:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:56,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,026 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:46:56,026 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 19:46:56,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 19:46:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-02-10 19:46:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:46:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3139 transitions. [2020-02-10 19:46:56,050 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3139 transitions. Word has length 25 [2020-02-10 19:46:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,050 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3139 transitions. [2020-02-10 19:46:56,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3139 transitions. [2020-02-10 19:46:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:56,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:56,051 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash 921714163, now seen corresponding path program 317 times [2020-02-10 19:46:56,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131377959] [2020-02-10 19:46:56,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:56,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131377959] [2020-02-10 19:46:56,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:56,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303160743] [2020-02-10 19:46:56,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:56,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:56,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:56,429 INFO L87 Difference]: Start difference. First operand 787 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:46:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,608 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-02-10 19:46:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:56,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,612 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 19:46:56,612 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:46:56,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:46:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-02-10 19:46:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:46:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3144 transitions. [2020-02-10 19:46:56,638 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3144 transitions. Word has length 25 [2020-02-10 19:46:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,638 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3144 transitions. [2020-02-10 19:46:56,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3144 transitions. [2020-02-10 19:46:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:56,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,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] [2020-02-10 19:46:56,640 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash -151371217, now seen corresponding path program 318 times [2020-02-10 19:46:56,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280273974] [2020-02-10 19:46:56,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:57,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280273974] [2020-02-10 19:46:57,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:57,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726479050] [2020-02-10 19:46:57,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:57,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:57,031 INFO L87 Difference]: Start difference. First operand 790 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:46:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,212 INFO L93 Difference]: Finished difference Result 1388 states and 4881 transitions. [2020-02-10 19:46:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:57,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,216 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:46:57,216 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 19:46:57,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 19:46:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 784. [2020-02-10 19:46:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:46:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-02-10 19:46:57,238 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-02-10 19:46:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,238 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-02-10 19:46:57,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-02-10 19:46:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:57,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:57,240 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1471343915, now seen corresponding path program 319 times [2020-02-10 19:46:57,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942271816] [2020-02-10 19:46:57,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:57,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942271816] [2020-02-10 19:46:57,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:57,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684469188] [2020-02-10 19:46:57,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:57,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:57,633 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-02-10 19:46:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,783 INFO L93 Difference]: Finished difference Result 1393 states and 4897 transitions. [2020-02-10 19:46:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:57,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,787 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 19:46:57,787 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:46:57,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:46:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-02-10 19:46:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:46:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 19:46:57,811 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 19:46:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,811 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 19:46:57,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 19:46:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:57,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:57,812 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -490589197, now seen corresponding path program 320 times [2020-02-10 19:46:57,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469231694] [2020-02-10 19:46:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:58,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469231694] [2020-02-10 19:46:58,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:58,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164102668] [2020-02-10 19:46:58,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:58,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:58,199 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:46:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,381 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-02-10 19:46:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:58,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,385 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 19:46:58,385 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 19:46:58,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 19:46:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 788. [2020-02-10 19:46:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 19:46:58,407 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 19:46:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,407 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 19:46:58,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 19:46:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:58,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,409 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash 11791023, now seen corresponding path program 321 times [2020-02-10 19:46:58,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502488515] [2020-02-10 19:46:58,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,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 19:46:58,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502488515] [2020-02-10 19:46:58,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:58,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486315890] [2020-02-10 19:46:58,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:58,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:58,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:58,799 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:46:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,938 INFO L93 Difference]: Finished difference Result 1401 states and 4910 transitions. [2020-02-10 19:46:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:58,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,942 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 19:46:58,942 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:46:58,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:46:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 793. [2020-02-10 19:46:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:46:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3151 transitions. [2020-02-10 19:46:58,965 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3151 transitions. Word has length 25 [2020-02-10 19:46:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,965 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3151 transitions. [2020-02-10 19:46:58,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3151 transitions. [2020-02-10 19:46:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:58,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,966 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1024055053, now seen corresponding path program 322 times [2020-02-10 19:46:58,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601096925] [2020-02-10 19:46:58,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,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 19:46:59,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601096925] [2020-02-10 19:46:59,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:59,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813443632] [2020-02-10 19:46:59,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:59,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:59,351 INFO L87 Difference]: Start difference. First operand 793 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:46:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,507 INFO L93 Difference]: Finished difference Result 1406 states and 4915 transitions. [2020-02-10 19:46:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:46:59,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:46:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,511 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:46:59,511 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:46:59,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:46:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 19:46:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:46:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 19:46:59,537 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 19:46:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,537 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 19:46:59,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:46:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 19:46:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:46:59,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:59,538 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 824824661, now seen corresponding path program 323 times [2020-02-10 19:46:59,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938124073] [2020-02-10 19:46:59,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:59,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938124073] [2020-02-10 19:46:59,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:46:59,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135555537] [2020-02-10 19:46:59,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:46:59,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:46:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:46:59,933 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:47:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,111 INFO L93 Difference]: Finished difference Result 1398 states and 4899 transitions. [2020-02-10 19:47:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:00,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,115 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 19:47:00,115 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 19:47:00,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 19:47:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-02-10 19:47:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 19:47:00,138 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 19:47:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,138 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 19:47:00,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 19:47:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:00,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,139 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1362680239, now seen corresponding path program 324 times [2020-02-10 19:47:00,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426504301] [2020-02-10 19:47:00,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:00,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426504301] [2020-02-10 19:47:00,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:00,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624457529] [2020-02-10 19:47:00,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:00,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:00,526 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:47:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,683 INFO L93 Difference]: Finished difference Result 1404 states and 4907 transitions. [2020-02-10 19:47:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:00,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,687 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 19:47:00,687 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 19:47:00,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 19:47:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 784. [2020-02-10 19:47:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:47:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 19:47:00,710 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 19:47:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,710 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 19:47:00,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 19:47:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:00,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,711 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1535752789, now seen corresponding path program 325 times [2020-02-10 19:47:00,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92492284] [2020-02-10 19:47:00,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:01,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92492284] [2020-02-10 19:47:01,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:01,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397999699] [2020-02-10 19:47:01,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:01,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:01,098 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:47:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,284 INFO L93 Difference]: Finished difference Result 1402 states and 4917 transitions. [2020-02-10 19:47:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:01,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,288 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 19:47:01,288 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:47:01,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:47:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-02-10 19:47:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 19:47:01,311 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 19:47:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,312 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 19:47:01,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 19:47:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:01,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,313 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1757453581, now seen corresponding path program 326 times [2020-02-10 19:47:01,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151152886] [2020-02-10 19:47:01,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:01,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151152886] [2020-02-10 19:47:01,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:01,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139394476] [2020-02-10 19:47:01,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:01,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:01,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:01,693 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:47:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,840 INFO L93 Difference]: Finished difference Result 1403 states and 4915 transitions. [2020-02-10 19:47:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:01,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,844 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:47:01,844 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:47:01,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:47:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 789. [2020-02-10 19:47:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:47:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-02-10 19:47:01,867 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-02-10 19:47:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,867 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-02-10 19:47:01,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-02-10 19:47:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:01,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,868 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash -833180429, now seen corresponding path program 327 times [2020-02-10 19:47:01,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031941156] [2020-02-10 19:47:01,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:02,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031941156] [2020-02-10 19:47:02,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:02,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461315803] [2020-02-10 19:47:02,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:02,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:02,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:02,261 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:47:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,387 INFO L93 Difference]: Finished difference Result 1407 states and 4922 transitions. [2020-02-10 19:47:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:02,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,391 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:47:02,391 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:47:02,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:47:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 794. [2020-02-10 19:47:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3150 transitions. [2020-02-10 19:47:02,414 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3150 transitions. Word has length 25 [2020-02-10 19:47:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,414 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3150 transitions. [2020-02-10 19:47:02,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3150 transitions. [2020-02-10 19:47:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:02,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,415 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash 179083601, now seen corresponding path program 328 times [2020-02-10 19:47:02,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249308811] [2020-02-10 19:47:02,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:02,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249308811] [2020-02-10 19:47:02,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:02,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162761375] [2020-02-10 19:47:02,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:02,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:02,803 INFO L87 Difference]: Start difference. First operand 794 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:47:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,905 INFO L93 Difference]: Finished difference Result 1412 states and 4927 transitions. [2020-02-10 19:47:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:02,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,909 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:47:02,909 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:47:02,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:47:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 789. [2020-02-10 19:47:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:47:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-02-10 19:47:02,932 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-02-10 19:47:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,932 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-02-10 19:47:02,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-02-10 19:47:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:02,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,933 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash -442039723, now seen corresponding path program 329 times [2020-02-10 19:47:02,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114397197] [2020-02-10 19:47:02,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,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 19:47:03,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114397197] [2020-02-10 19:47:03,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:03,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332086136] [2020-02-10 19:47:03,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:03,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:03,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:03,319 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:47:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,446 INFO L93 Difference]: Finished difference Result 1410 states and 4924 transitions. [2020-02-10 19:47:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:03,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,450 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 19:47:03,451 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:47:03,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:47:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 795. [2020-02-10 19:47:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3147 transitions. [2020-02-10 19:47:03,474 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3147 transitions. Word has length 25 [2020-02-10 19:47:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,474 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3147 transitions. [2020-02-10 19:47:03,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3147 transitions. [2020-02-10 19:47:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:03,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,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] [2020-02-10 19:47:03,476 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1168901235, now seen corresponding path program 330 times [2020-02-10 19:47:03,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606160706] [2020-02-10 19:47:03,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:03,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606160706] [2020-02-10 19:47:03,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:03,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494169067] [2020-02-10 19:47:03,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:03,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:03,862 INFO L87 Difference]: Start difference. First operand 795 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:47:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,965 INFO L93 Difference]: Finished difference Result 1414 states and 4926 transitions. [2020-02-10 19:47:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:03,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,969 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:47:03,969 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:47:03,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:47:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 784. [2020-02-10 19:47:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:47:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-02-10 19:47:03,993 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-02-10 19:47:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,993 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-02-10 19:47:03,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-02-10 19:47:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:03,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:03,994 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1250129199, now seen corresponding path program 331 times [2020-02-10 19:47:03,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424227067] [2020-02-10 19:47:03,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:04,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424227067] [2020-02-10 19:47:04,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:04,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752796154] [2020-02-10 19:47:04,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:04,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:04,361 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-02-10 19:47:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,490 INFO L93 Difference]: Finished difference Result 1395 states and 4894 transitions. [2020-02-10 19:47:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:04,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,494 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:47:04,494 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:47:04,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:47:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-02-10 19:47:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:47:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3142 transitions. [2020-02-10 19:47:04,518 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3142 transitions. Word has length 25 [2020-02-10 19:47:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,519 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3142 transitions. [2020-02-10 19:47:04,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3142 transitions. [2020-02-10 19:47:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:04,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:04,520 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752717, now seen corresponding path program 332 times [2020-02-10 19:47:04,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315078006] [2020-02-10 19:47:04,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:04,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315078006] [2020-02-10 19:47:04,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:04,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176977527] [2020-02-10 19:47:04,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:04,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:04,896 INFO L87 Difference]: Start difference. First operand 791 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:47:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,023 INFO L93 Difference]: Finished difference Result 1397 states and 4895 transitions. [2020-02-10 19:47:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:05,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,028 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 19:47:05,028 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:47:05,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:47:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-02-10 19:47:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:47:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 19:47:05,052 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 19:47:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,052 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 19:47:05,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 19:47:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:05,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:05,053 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1444400243, now seen corresponding path program 333 times [2020-02-10 19:47:05,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688753498] [2020-02-10 19:47:05,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,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 19:47:05,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688753498] [2020-02-10 19:47:05,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:05,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907944811] [2020-02-10 19:47:05,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:05,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:05,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:05,421 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:47:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,546 INFO L93 Difference]: Finished difference Result 1400 states and 4900 transitions. [2020-02-10 19:47:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:05,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,550 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 19:47:05,550 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:47:05,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:47:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 19:47:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 19:47:05,573 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 19:47:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,573 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 19:47:05,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 19:47:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:05,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:05,574 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1982255821, now seen corresponding path program 334 times [2020-02-10 19:47:05,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073693490] [2020-02-10 19:47:05,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:05,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073693490] [2020-02-10 19:47:05,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:05,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983537821] [2020-02-10 19:47:05,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:05,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:05,950 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:47:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,055 INFO L93 Difference]: Finished difference Result 1406 states and 4908 transitions. [2020-02-10 19:47:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:06,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,059 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:47:06,059 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 19:47:06,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 19:47:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 788. [2020-02-10 19:47:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:47:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-02-10 19:47:06,083 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-02-10 19:47:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,083 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-02-10 19:47:06,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-02-10 19:47:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:06,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:06,085 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1465406451, now seen corresponding path program 335 times [2020-02-10 19:47:06,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951185132] [2020-02-10 19:47:06,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,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 19:47:06,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951185132] [2020-02-10 19:47:06,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:06,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565059344] [2020-02-10 19:47:06,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:06,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:06,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:06,474 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:47:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,602 INFO L93 Difference]: Finished difference Result 1406 states and 4910 transitions. [2020-02-10 19:47:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:06,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,606 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:47:06,607 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 19:47:06,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 19:47:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 794. [2020-02-10 19:47:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-02-10 19:47:06,630 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-02-10 19:47:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,630 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-02-10 19:47:06,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-02-10 19:47:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:06,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:06,631 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1218619887, now seen corresponding path program 336 times [2020-02-10 19:47:06,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734587951] [2020-02-10 19:47:06,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:07,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734587951] [2020-02-10 19:47:07,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:07,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555562234] [2020-02-10 19:47:07,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:07,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:07,019 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:47:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,124 INFO L93 Difference]: Finished difference Result 1410 states and 4912 transitions. [2020-02-10 19:47:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:07,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,127 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 19:47:07,127 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 19:47:07,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 19:47:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 780. [2020-02-10 19:47:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:47:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 19:47:07,150 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 19:47:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,150 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 19:47:07,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 19:47:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:07,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,152 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1832995017, now seen corresponding path program 337 times [2020-02-10 19:47:07,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838917624] [2020-02-10 19:47:07,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838917624] [2020-02-10 19:47:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:07,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23181346] [2020-02-10 19:47:07,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:07,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:07,524 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:47:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,649 INFO L93 Difference]: Finished difference Result 1399 states and 4914 transitions. [2020-02-10 19:47:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:07,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,653 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:47:07,653 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 19:47:07,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 19:47:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 790. [2020-02-10 19:47:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-02-10 19:47:07,677 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-02-10 19:47:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,677 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-02-10 19:47:07,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-02-10 19:47:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:07,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,678 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -222054059, now seen corresponding path program 338 times [2020-02-10 19:47:07,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694818658] [2020-02-10 19:47:07,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,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 19:47:08,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694818658] [2020-02-10 19:47:08,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:08,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303031621] [2020-02-10 19:47:08,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:08,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:08,053 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:47:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,174 INFO L93 Difference]: Finished difference Result 1396 states and 4905 transitions. [2020-02-10 19:47:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:08,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,178 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 19:47:08,178 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 19:47:08,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 19:47:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 787. [2020-02-10 19:47:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:47:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 19:47:08,201 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 19:47:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,201 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 19:47:08,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 19:47:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:08,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,203 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash -738903429, now seen corresponding path program 339 times [2020-02-10 19:47:08,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163672587] [2020-02-10 19:47:08,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:08,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163672587] [2020-02-10 19:47:08,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:08,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809585224] [2020-02-10 19:47:08,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:08,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:08,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:08,586 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:47:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,718 INFO L93 Difference]: Finished difference Result 1403 states and 4921 transitions. [2020-02-10 19:47:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:08,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,722 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:47:08,722 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:47:08,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:47:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 19:47:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 19:47:08,746 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 19:47:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,746 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 19:47:08,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 19:47:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:08,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,748 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash -201047851, now seen corresponding path program 340 times [2020-02-10 19:47:08,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277594427] [2020-02-10 19:47:08,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,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 19:47:09,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277594427] [2020-02-10 19:47:09,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:09,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984401419] [2020-02-10 19:47:09,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:09,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:09,133 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:47:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,260 INFO L93 Difference]: Finished difference Result 1402 states and 4914 transitions. [2020-02-10 19:47:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:09,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,264 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 19:47:09,264 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:47:09,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:47:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 787. [2020-02-10 19:47:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:47:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-02-10 19:47:09,288 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-02-10 19:47:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,288 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-02-10 19:47:09,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-02-10 19:47:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:09,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:09,289 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash -728400325, now seen corresponding path program 341 times [2020-02-10 19:47:09,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709265844] [2020-02-10 19:47:09,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:09,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709265844] [2020-02-10 19:47:09,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:09,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382828237] [2020-02-10 19:47:09,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:09,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:09,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:09,666 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:47:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,785 INFO L93 Difference]: Finished difference Result 1395 states and 4900 transitions. [2020-02-10 19:47:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:09,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,789 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:47:09,789 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:47:09,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:47:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 790. [2020-02-10 19:47:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 19:47:09,813 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 19:47:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,813 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 19:47:09,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 19:47:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:09,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:09,814 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1801485705, now seen corresponding path program 342 times [2020-02-10 19:47:09,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115856070] [2020-02-10 19:47:09,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:10,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115856070] [2020-02-10 19:47:10,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:10,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907511089] [2020-02-10 19:47:10,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:10,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:10,194 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:47:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,336 INFO L93 Difference]: Finished difference Result 1397 states and 4901 transitions. [2020-02-10 19:47:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:10,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,340 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 19:47:10,340 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 19:47:10,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 19:47:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 784. [2020-02-10 19:47:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:47:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 19:47:10,362 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 19:47:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,362 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 19:47:10,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 19:47:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:10,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,364 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash 93039061, now seen corresponding path program 343 times [2020-02-10 19:47:10,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538246506] [2020-02-10 19:47:10,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,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 19:47:10,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538246506] [2020-02-10 19:47:10,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:10,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039177985] [2020-02-10 19:47:10,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:10,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:10,750 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:47:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,880 INFO L93 Difference]: Finished difference Result 1407 states and 4928 transitions. [2020-02-10 19:47:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:10,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,884 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:47:10,884 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 19:47:10,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 19:47:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-02-10 19:47:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:47:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 19:47:10,907 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 19:47:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,908 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 19:47:10,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 19:47:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:10,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,909 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1703980019, now seen corresponding path program 344 times [2020-02-10 19:47:10,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670442375] [2020-02-10 19:47:10,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:11,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670442375] [2020-02-10 19:47:11,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:11,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899956148] [2020-02-10 19:47:11,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:11,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:11,281 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:47:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,408 INFO L93 Difference]: Finished difference Result 1404 states and 4919 transitions. [2020-02-10 19:47:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:11,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,411 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 19:47:11,412 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:47:11,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:47:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-02-10 19:47:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:47:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 19:47:11,434 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 19:47:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,434 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 19:47:11,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 19:47:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:11,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,435 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,436 INFO L82 PathProgramCache]: Analyzing trace with hash -413307205, now seen corresponding path program 345 times [2020-02-10 19:47:11,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202126654] [2020-02-10 19:47:11,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:11,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202126654] [2020-02-10 19:47:11,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:11,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484999060] [2020-02-10 19:47:11,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:11,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:11,812 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:47:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,939 INFO L93 Difference]: Finished difference Result 1417 states and 4947 transitions. [2020-02-10 19:47:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:11,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,942 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:47:11,942 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:47:11,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:47:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-02-10 19:47:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 19:47:11,965 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 19:47:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,965 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 19:47:11,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 19:47:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:11,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,966 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1735489331, now seen corresponding path program 346 times [2020-02-10 19:47:11,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138403813] [2020-02-10 19:47:11,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:12,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138403813] [2020-02-10 19:47:12,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:12,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131062182] [2020-02-10 19:47:12,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:12,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:12,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:12,353 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:47:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,458 INFO L93 Difference]: Finished difference Result 1420 states and 4946 transitions. [2020-02-10 19:47:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:12,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,462 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 19:47:12,462 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 19:47:12,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 19:47:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 788. [2020-02-10 19:47:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:47:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 19:47:12,486 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 19:47:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,486 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 19:47:12,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 19:47:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:12,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:12,487 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash -402804101, now seen corresponding path program 347 times [2020-02-10 19:47:12,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312156550] [2020-02-10 19:47:12,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:12,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312156550] [2020-02-10 19:47:12,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:12,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607205827] [2020-02-10 19:47:12,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:12,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:12,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:12,885 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:47:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:13,015 INFO L93 Difference]: Finished difference Result 1408 states and 4922 transitions. [2020-02-10 19:47:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:13,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:13,018 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 19:47:13,019 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:47:13,019 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:47:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 19:47:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 19:47:13,041 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 19:47:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:13,041 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 19:47:13,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 19:47:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:13,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:13,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:13,042 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash 135051477, now seen corresponding path program 348 times [2020-02-10 19:47:13,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:13,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102805050] [2020-02-10 19:47:13,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:13,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102805050] [2020-02-10 19:47:13,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:13,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:13,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845018530] [2020-02-10 19:47:13,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:13,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:13,449 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:47:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:13,576 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-02-10 19:47:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:13,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:13,580 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:47:13,580 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:47:13,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:47:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 784. [2020-02-10 19:47:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:47:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-02-10 19:47:13,602 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-02-10 19:47:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:13,602 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-02-10 19:47:13,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-02-10 19:47:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:13,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:13,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:13,603 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 744231509, now seen corresponding path program 349 times [2020-02-10 19:47:13,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083424877] [2020-02-10 19:47:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:13,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 19:47:13,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083424877] [2020-02-10 19:47:13,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:13,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:13,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735483083] [2020-02-10 19:47:13,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:13,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:13,984 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-02-10 19:47:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:14,117 INFO L93 Difference]: Finished difference Result 1419 states and 4958 transitions. [2020-02-10 19:47:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:14,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:14,121 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:47:14,121 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 19:47:14,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 19:47:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-02-10 19:47:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-02-10 19:47:14,144 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-02-10 19:47:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:14,144 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-02-10 19:47:14,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-02-10 19:47:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:14,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:14,145 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1282087087, now seen corresponding path program 350 times [2020-02-10 19:47:14,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233538703] [2020-02-10 19:47:14,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:14,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233538703] [2020-02-10 19:47:14,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:14,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:14,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146201640] [2020-02-10 19:47:14,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:14,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:14,526 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:47:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:14,687 INFO L93 Difference]: Finished difference Result 1418 states and 4951 transitions. [2020-02-10 19:47:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:14,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:14,691 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:47:14,691 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:47:14,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:47:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 19:47:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 19:47:14,713 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 19:47:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:14,713 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 19:47:14,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 19:47:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:14,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:14,714 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash -856206345, now seen corresponding path program 351 times [2020-02-10 19:47:14,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830161242] [2020-02-10 19:47:14,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:15,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 19:47:15,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830161242] [2020-02-10 19:47:15,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:15,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:15,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024940488] [2020-02-10 19:47:15,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:15,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:15,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:15,112 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:47:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:15,256 INFO L93 Difference]: Finished difference Result 1425 states and 4965 transitions. [2020-02-10 19:47:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:15,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:15,260 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 19:47:15,260 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:47:15,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:47:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 797. [2020-02-10 19:47:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3153 transitions. [2020-02-10 19:47:15,283 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3153 transitions. Word has length 25 [2020-02-10 19:47:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:15,283 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3153 transitions. [2020-02-10 19:47:15,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3153 transitions. [2020-02-10 19:47:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:15,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:15,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:15,284 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1292590191, now seen corresponding path program 352 times [2020-02-10 19:47:15,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:15,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005415249] [2020-02-10 19:47:15,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:15,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005415249] [2020-02-10 19:47:15,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:15,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:15,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646302513] [2020-02-10 19:47:15,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:15,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:15,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:15,675 INFO L87 Difference]: Start difference. First operand 797 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:47:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:15,786 INFO L93 Difference]: Finished difference Result 1428 states and 4964 transitions. [2020-02-10 19:47:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:15,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:15,790 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:47:15,790 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:47:15,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:47:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 19:47:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3134 transitions. [2020-02-10 19:47:15,813 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3134 transitions. Word has length 25 [2020-02-10 19:47:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:15,813 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3134 transitions. [2020-02-10 19:47:15,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3134 transitions. [2020-02-10 19:47:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:15,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:15,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:15,815 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:15,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash -824697033, now seen corresponding path program 353 times [2020-02-10 19:47:15,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:15,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018496686] [2020-02-10 19:47:15,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:16,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018496686] [2020-02-10 19:47:16,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:16,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744766397] [2020-02-10 19:47:16,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:16,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:16,200 INFO L87 Difference]: Start difference. First operand 790 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:47:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:16,323 INFO L93 Difference]: Finished difference Result 1422 states and 4952 transitions. [2020-02-10 19:47:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:16,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:16,326 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:47:16,326 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 19:47:16,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 19:47:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 796. [2020-02-10 19:47:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:47:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-02-10 19:47:16,349 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-02-10 19:47:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:16,349 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-02-10 19:47:16,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-02-10 19:47:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:16,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:16,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] [2020-02-10 19:47:16,350 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:16,351 INFO L82 PathProgramCache]: Analyzing trace with hash 786243925, now seen corresponding path program 354 times [2020-02-10 19:47:16,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:16,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560840071] [2020-02-10 19:47:16,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,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 19:47:16,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560840071] [2020-02-10 19:47:16,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:16,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752926750] [2020-02-10 19:47:16,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:16,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:16,727 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:47:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:16,833 INFO L93 Difference]: Finished difference Result 1426 states and 4954 transitions. [2020-02-10 19:47:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:16,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:16,837 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 19:47:16,837 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:47:16,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:47:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 784. [2020-02-10 19:47:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:47:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 19:47:16,859 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 19:47:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:16,859 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 19:47:16,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 19:47:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:16,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:16,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:16,861 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1614198605, now seen corresponding path program 355 times [2020-02-10 19:47:16,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:16,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930979196] [2020-02-10 19:47:16,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:17,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930979196] [2020-02-10 19:47:17,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:17,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:17,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104966036] [2020-02-10 19:47:17,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:17,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:17,234 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:47:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:17,360 INFO L93 Difference]: Finished difference Result 1401 states and 4907 transitions. [2020-02-10 19:47:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:17,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:17,364 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 19:47:17,364 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:47:17,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:47:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-02-10 19:47:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:47:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-02-10 19:47:17,386 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-02-10 19:47:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:17,386 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-02-10 19:47:17,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-02-10 19:47:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:17,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:17,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:17,387 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:17,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1607683311, now seen corresponding path program 356 times [2020-02-10 19:47:17,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:17,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033849024] [2020-02-10 19:47:17,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:17,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033849024] [2020-02-10 19:47:17,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:17,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:17,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991175091] [2020-02-10 19:47:17,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:17,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:17,752 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:47:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:17,881 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-02-10 19:47:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:17,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:17,885 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:47:17,885 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 19:47:17,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 19:47:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 788. [2020-02-10 19:47:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:47:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-02-10 19:47:17,908 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-02-10 19:47:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:17,908 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-02-10 19:47:17,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-02-10 19:47:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:17,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:17,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:17,909 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1080330837, now seen corresponding path program 357 times [2020-02-10 19:47:17,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:17,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560014631] [2020-02-10 19:47:17,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:18,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560014631] [2020-02-10 19:47:18,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:18,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:18,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547005696] [2020-02-10 19:47:18,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:18,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:18,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:18,276 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:47:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:18,405 INFO L93 Difference]: Finished difference Result 1406 states and 4913 transitions. [2020-02-10 19:47:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:18,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:18,408 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:47:18,408 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:47:18,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:47:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-02-10 19:47:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 19:47:18,430 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 19:47:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:18,430 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 19:47:18,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 19:47:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:18,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:18,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:18,431 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1618186415, now seen corresponding path program 358 times [2020-02-10 19:47:18,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:18,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381880347] [2020-02-10 19:47:18,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:18,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381880347] [2020-02-10 19:47:18,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:18,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:18,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532260778] [2020-02-10 19:47:18,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:18,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:18,806 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:47:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:18,935 INFO L93 Difference]: Finished difference Result 1412 states and 4921 transitions. [2020-02-10 19:47:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:18,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:18,939 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:47:18,939 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:47:18,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:47:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 788. [2020-02-10 19:47:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:47:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3126 transitions. [2020-02-10 19:47:18,962 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3126 transitions. Word has length 25 [2020-02-10 19:47:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:18,962 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3126 transitions. [2020-02-10 19:47:18,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3126 transitions. [2020-02-10 19:47:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:18,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:18,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:18,963 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:18,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:18,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1101337045, now seen corresponding path program 359 times [2020-02-10 19:47:18,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:18,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565900556] [2020-02-10 19:47:18,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:19,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565900556] [2020-02-10 19:47:19,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:19,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:19,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095720135] [2020-02-10 19:47:19,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:19,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:19,333 INFO L87 Difference]: Start difference. First operand 788 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:47:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:19,472 INFO L93 Difference]: Finished difference Result 1412 states and 4923 transitions. [2020-02-10 19:47:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:19,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:19,475 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:47:19,475 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:47:19,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:47:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 19:47:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 19:47:19,498 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 19:47:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:19,498 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 19:47:19,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 19:47:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:19,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:19,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:19,499 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1582689293, now seen corresponding path program 360 times [2020-02-10 19:47:19,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:19,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840433535] [2020-02-10 19:47:19,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:19,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840433535] [2020-02-10 19:47:19,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:19,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:19,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918700793] [2020-02-10 19:47:19,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:19,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:19,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:19,876 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:47:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:19,984 INFO L93 Difference]: Finished difference Result 1416 states and 4925 transitions. [2020-02-10 19:47:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:19,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:19,988 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:47:19,988 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:47:19,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:47:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 776. [2020-02-10 19:47:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:47:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3101 transitions. [2020-02-10 19:47:20,013 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3101 transitions. Word has length 25 [2020-02-10 19:47:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:20,014 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3101 transitions. [2020-02-10 19:47:20,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3101 transitions. [2020-02-10 19:47:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:20,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:20,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:20,015 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash 519656473, now seen corresponding path program 361 times [2020-02-10 19:47:20,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:20,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993584269] [2020-02-10 19:47:20,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:20,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993584269] [2020-02-10 19:47:20,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:20,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:20,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225994127] [2020-02-10 19:47:20,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:20,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:20,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:20,395 INFO L87 Difference]: Start difference. First operand 776 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:47:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:20,542 INFO L93 Difference]: Finished difference Result 1450 states and 5092 transitions. [2020-02-10 19:47:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:20,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:20,546 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:47:20,546 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 19:47:20,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 19:47:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-02-10 19:47:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3180 transitions. [2020-02-10 19:47:20,570 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3180 transitions. Word has length 25 [2020-02-10 19:47:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:20,570 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3180 transitions. [2020-02-10 19:47:20,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3180 transitions. [2020-02-10 19:47:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:20,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:20,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] [2020-02-10 19:47:20,572 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1489908087, now seen corresponding path program 362 times [2020-02-10 19:47:20,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:20,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672050135] [2020-02-10 19:47:20,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:20,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 19:47:20,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672050135] [2020-02-10 19:47:20,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:20,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:20,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760765705] [2020-02-10 19:47:20,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:20,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:20,950 INFO L87 Difference]: Start difference. First operand 797 states and 3180 transitions. Second operand 10 states. [2020-02-10 19:47:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,099 INFO L93 Difference]: Finished difference Result 1452 states and 5092 transitions. [2020-02-10 19:47:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:21,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,103 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 19:47:21,103 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 19:47:21,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 19:47:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 793. [2020-02-10 19:47:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-02-10 19:47:21,126 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-02-10 19:47:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:21,126 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-02-10 19:47:21,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-02-10 19:47:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:21,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:21,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:21,127 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 76757333, now seen corresponding path program 363 times [2020-02-10 19:47:21,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:21,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176451131] [2020-02-10 19:47:21,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:21,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176451131] [2020-02-10 19:47:21,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:21,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:21,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962361454] [2020-02-10 19:47:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:21,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:21,520 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:47:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,647 INFO L93 Difference]: Finished difference Result 1451 states and 5090 transitions. [2020-02-10 19:47:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:21,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,651 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 19:47:21,651 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 19:47:21,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 19:47:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 797. [2020-02-10 19:47:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-02-10 19:47:21,674 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-02-10 19:47:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:21,674 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-02-10 19:47:21,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-02-10 19:47:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:21,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:21,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:21,675 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:21,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1068015155, now seen corresponding path program 364 times [2020-02-10 19:47:21,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:21,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101100481] [2020-02-10 19:47:21,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:22,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 19:47:22,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101100481] [2020-02-10 19:47:22,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:22,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:22,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894321185] [2020-02-10 19:47:22,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:22,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:22,054 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-02-10 19:47:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:22,185 INFO L93 Difference]: Finished difference Result 1454 states and 5092 transitions. [2020-02-10 19:47:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:22,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:22,189 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 19:47:22,189 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:47:22,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:47:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 793. [2020-02-10 19:47:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 19:47:22,212 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 19:47:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:22,212 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 19:47:22,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 19:47:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:22,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:22,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:22,213 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2140837799, now seen corresponding path program 365 times [2020-02-10 19:47:22,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:22,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086208152] [2020-02-10 19:47:22,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:22,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086208152] [2020-02-10 19:47:22,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:22,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:22,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128981531] [2020-02-10 19:47:22,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:22,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:22,594 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:47:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:22,718 INFO L93 Difference]: Finished difference Result 1457 states and 5100 transitions. [2020-02-10 19:47:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:22,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:22,722 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:47:22,722 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 19:47:22,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 19:47:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 799. [2020-02-10 19:47:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:47:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3176 transitions. [2020-02-10 19:47:22,745 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3176 transitions. Word has length 25 [2020-02-10 19:47:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:22,745 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3176 transitions. [2020-02-10 19:47:22,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3176 transitions. [2020-02-10 19:47:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:22,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:22,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:22,746 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:22,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1081044117, now seen corresponding path program 366 times [2020-02-10 19:47:22,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:22,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824088630] [2020-02-10 19:47:22,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:23,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 19:47:23,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824088630] [2020-02-10 19:47:23,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:23,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:23,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932062488] [2020-02-10 19:47:23,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:23,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:23,123 INFO L87 Difference]: Start difference. First operand 799 states and 3176 transitions. Second operand 10 states. [2020-02-10 19:47:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:23,258 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 19:47:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:23,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:23,262 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 19:47:23,262 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:47:23,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:47:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-02-10 19:47:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:47:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 19:47:23,285 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 19:47:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:23,285 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 19:47:23,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 19:47:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:23,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:23,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:23,286 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 97170747, now seen corresponding path program 367 times [2020-02-10 19:47:23,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:23,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220708083] [2020-02-10 19:47:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:23,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220708083] [2020-02-10 19:47:23,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:23,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:23,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525726851] [2020-02-10 19:47:23,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:23,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:23,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:23,667 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:47:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:23,806 INFO L93 Difference]: Finished difference Result 1447 states and 5081 transitions. [2020-02-10 19:47:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:23,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:23,810 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:47:23,810 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:47:23,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:47:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 19:47:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-02-10 19:47:23,832 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-02-10 19:47:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:23,833 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-02-10 19:47:23,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-02-10 19:47:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:23,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:23,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:23,834 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1067422361, now seen corresponding path program 368 times [2020-02-10 19:47:23,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:23,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942227204] [2020-02-10 19:47:23,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:24,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942227204] [2020-02-10 19:47:24,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:24,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:24,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417124575] [2020-02-10 19:47:24,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:24,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:24,213 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-02-10 19:47:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:24,341 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-02-10 19:47:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:24,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:24,344 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:47:24,345 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:47:24,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:47:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 19:47:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 19:47:24,367 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 19:47:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:24,367 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 19:47:24,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 19:47:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:24,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:24,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:24,368 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1580305685, now seen corresponding path program 369 times [2020-02-10 19:47:24,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:24,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611247841] [2020-02-10 19:47:24,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:24,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611247841] [2020-02-10 19:47:24,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:24,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:24,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854530745] [2020-02-10 19:47:24,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:24,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:24,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:24,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:24,753 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:47:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:24,898 INFO L93 Difference]: Finished difference Result 1446 states and 5075 transitions. [2020-02-10 19:47:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:24,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:24,902 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:47:24,902 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 19:47:24,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 19:47:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 797. [2020-02-10 19:47:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-02-10 19:47:24,925 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-02-10 19:47:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:24,925 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-02-10 19:47:24,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-02-10 19:47:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:24,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:24,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:24,926 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1712900685, now seen corresponding path program 370 times [2020-02-10 19:47:24,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:24,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100984315] [2020-02-10 19:47:24,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:25,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100984315] [2020-02-10 19:47:25,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:25,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:25,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553026243] [2020-02-10 19:47:25,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:25,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:25,317 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:47:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:25,442 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-02-10 19:47:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:25,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:25,446 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:47:25,446 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 19:47:25,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 19:47:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-02-10 19:47:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 19:47:25,469 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 19:47:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:25,469 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 19:47:25,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 19:47:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:25,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:25,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:25,471 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:25,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2057239995, now seen corresponding path program 371 times [2020-02-10 19:47:25,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:25,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72883052] [2020-02-10 19:47:25,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:25,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72883052] [2020-02-10 19:47:25,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:25,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:25,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836046576] [2020-02-10 19:47:25,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:25,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:25,858 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:47:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:25,999 INFO L93 Difference]: Finished difference Result 1451 states and 5082 transitions. [2020-02-10 19:47:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:25,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:26,003 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 19:47:26,003 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:47:26,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:47:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-02-10 19:47:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:47:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-02-10 19:47:26,025 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-02-10 19:47:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:26,025 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-02-10 19:47:26,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-02-10 19:47:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:26,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:26,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:26,027 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1699871723, now seen corresponding path program 372 times [2020-02-10 19:47:26,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:26,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770306407] [2020-02-10 19:47:26,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:26,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770306407] [2020-02-10 19:47:26,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:26,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:26,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927569338] [2020-02-10 19:47:26,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:26,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:26,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:26,407 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:47:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:26,543 INFO L93 Difference]: Finished difference Result 1450 states and 5075 transitions. [2020-02-10 19:47:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:26,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:26,546 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:47:26,547 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 19:47:26,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 19:47:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2020-02-10 19:47:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:47:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-02-10 19:47:26,569 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-02-10 19:47:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:26,569 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-02-10 19:47:26,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-02-10 19:47:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:26,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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] [2020-02-10 19:47:26,571 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1190699845, now seen corresponding path program 373 times [2020-02-10 19:47:26,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:26,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859330795] [2020-02-10 19:47:26,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:26,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859330795] [2020-02-10 19:47:26,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:26,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:26,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802834078] [2020-02-10 19:47:26,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:26,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:26,950 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:47:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:27,082 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-02-10 19:47:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:27,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:27,086 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:47:27,087 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:47:27,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:47:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-02-10 19:47:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-02-10 19:47:27,109 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-02-10 19:47:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:27,109 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-02-10 19:47:27,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-02-10 19:47:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:27,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:27,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:27,111 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -199442023, now seen corresponding path program 374 times [2020-02-10 19:47:27,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:27,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977872722] [2020-02-10 19:47:27,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:27,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977872722] [2020-02-10 19:47:27,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:27,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:27,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745567549] [2020-02-10 19:47:27,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:27,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:27,485 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:47:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:27,629 INFO L93 Difference]: Finished difference Result 1452 states and 5083 transitions. [2020-02-10 19:47:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:27,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:27,633 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 19:47:27,633 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:47:27,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:47:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 793. [2020-02-10 19:47:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 19:47:27,655 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 19:47:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:27,656 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 19:47:27,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 19:47:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:27,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:27,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:27,657 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash 735334233, now seen corresponding path program 375 times [2020-02-10 19:47:27,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:27,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386754236] [2020-02-10 19:47:27,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:28,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 19:47:28,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386754236] [2020-02-10 19:47:28,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:28,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:28,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877044061] [2020-02-10 19:47:28,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:28,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:28,053 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:47:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:28,178 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-02-10 19:47:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:28,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:28,182 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:47:28,182 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:47:28,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:47:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 19:47:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 19:47:28,205 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 19:47:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:28,205 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 19:47:28,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 19:47:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:28,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:28,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:28,206 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1737095159, now seen corresponding path program 376 times [2020-02-10 19:47:28,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:28,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930468110] [2020-02-10 19:47:28,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:28,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 19:47:28,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930468110] [2020-02-10 19:47:28,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:28,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:28,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326222290] [2020-02-10 19:47:28,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:28,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:28,596 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:47:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:28,727 INFO L93 Difference]: Finished difference Result 1448 states and 5071 transitions. [2020-02-10 19:47:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:28,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:28,731 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 19:47:28,731 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:47:28,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:47:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 19:47:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:47:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 19:47:28,753 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 19:47:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:28,753 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 19:47:28,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 19:47:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:28,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:28,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:28,755 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 790375611, now seen corresponding path program 377 times [2020-02-10 19:47:28,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:28,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994660095] [2020-02-10 19:47:28,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:29,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 19:47:29,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994660095] [2020-02-10 19:47:29,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:29,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:29,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353040647] [2020-02-10 19:47:29,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:29,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:29,134 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:47:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:29,284 INFO L93 Difference]: Finished difference Result 1454 states and 5084 transitions. [2020-02-10 19:47:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:29,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:29,289 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 19:47:29,289 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 19:47:29,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 19:47:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 798. [2020-02-10 19:47:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:47:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-02-10 19:47:29,314 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-02-10 19:47:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:29,314 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-02-10 19:47:29,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-02-10 19:47:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:29,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:29,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:29,316 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1893650727, now seen corresponding path program 378 times [2020-02-10 19:47:29,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:29,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315438435] [2020-02-10 19:47:29,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:29,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 19:47:29,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315438435] [2020-02-10 19:47:29,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:29,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:29,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428164907] [2020-02-10 19:47:29,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:29,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:29,696 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-02-10 19:47:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:29,831 INFO L93 Difference]: Finished difference Result 1452 states and 5075 transitions. [2020-02-10 19:47:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:29,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:29,836 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 19:47:29,836 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 19:47:29,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 19:47:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 789. [2020-02-10 19:47:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:47:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-02-10 19:47:29,860 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-02-10 19:47:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:29,861 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-02-10 19:47:29,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-02-10 19:47:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:29,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:29,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:29,862 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1521262217, now seen corresponding path program 379 times [2020-02-10 19:47:29,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:29,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955327781] [2020-02-10 19:47:29,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:30,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955327781] [2020-02-10 19:47:30,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:30,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:30,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420334722] [2020-02-10 19:47:30,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:30,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:30,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:30,248 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:47:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:30,373 INFO L93 Difference]: Finished difference Result 1461 states and 5108 transitions. [2020-02-10 19:47:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:30,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:30,377 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 19:47:30,377 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 19:47:30,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 19:47:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 800. [2020-02-10 19:47:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:47:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3176 transitions. [2020-02-10 19:47:30,400 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3176 transitions. Word has length 25 [2020-02-10 19:47:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:30,400 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3176 transitions. [2020-02-10 19:47:30,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3176 transitions. [2020-02-10 19:47:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:30,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:30,402 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:30,402 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1700619699, now seen corresponding path program 380 times [2020-02-10 19:47:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:30,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933656390] [2020-02-10 19:47:30,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:30,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933656390] [2020-02-10 19:47:30,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:30,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:30,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410628418] [2020-02-10 19:47:30,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:30,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:30,794 INFO L87 Difference]: Start difference. First operand 800 states and 3176 transitions. Second operand 10 states. [2020-02-10 19:47:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:30,918 INFO L93 Difference]: Finished difference Result 1462 states and 5104 transitions. [2020-02-10 19:47:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:30,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:30,921 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 19:47:30,921 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 19:47:30,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 19:47:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 794. [2020-02-10 19:47:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3160 transitions. [2020-02-10 19:47:30,944 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3160 transitions. Word has length 25 [2020-02-10 19:47:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:30,944 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3160 transitions. [2020-02-10 19:47:30,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3160 transitions. [2020-02-10 19:47:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:30,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:30,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:30,945 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1173267225, now seen corresponding path program 381 times [2020-02-10 19:47:30,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:30,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636713021] [2020-02-10 19:47:30,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:31,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 19:47:31,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636713021] [2020-02-10 19:47:31,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:31,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:31,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127963016] [2020-02-10 19:47:31,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:31,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:31,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:31,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:31,331 INFO L87 Difference]: Start difference. First operand 794 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:47:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:31,455 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 19:47:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:31,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:31,458 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 19:47:31,459 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 19:47:31,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 19:47:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 799. [2020-02-10 19:47:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:47:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3169 transitions. [2020-02-10 19:47:31,480 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3169 transitions. Word has length 25 [2020-02-10 19:47:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:31,481 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3169 transitions. [2020-02-10 19:47:31,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3169 transitions. [2020-02-10 19:47:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:31,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:31,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:31,482 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1711122803, now seen corresponding path program 382 times [2020-02-10 19:47:31,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:31,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887165397] [2020-02-10 19:47:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:31,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887165397] [2020-02-10 19:47:31,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:31,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:31,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336422029] [2020-02-10 19:47:31,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:31,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:31,878 INFO L87 Difference]: Start difference. First operand 799 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:47:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:32,005 INFO L93 Difference]: Finished difference Result 1457 states and 5089 transitions. [2020-02-10 19:47:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:32,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:32,009 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:47:32,009 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 19:47:32,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 19:47:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-02-10 19:47:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-02-10 19:47:32,032 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-02-10 19:47:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:32,032 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-02-10 19:47:32,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-02-10 19:47:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:32,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:32,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:32,033 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1194273433, now seen corresponding path program 383 times [2020-02-10 19:47:32,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:32,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822362065] [2020-02-10 19:47:32,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:32,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822362065] [2020-02-10 19:47:32,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:32,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:32,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466709551] [2020-02-10 19:47:32,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:32,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:32,411 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:47:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:32,534 INFO L93 Difference]: Finished difference Result 1460 states and 5095 transitions. [2020-02-10 19:47:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:32,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:32,538 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 19:47:32,538 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:47:32,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:47:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 799. [2020-02-10 19:47:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:47:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3164 transitions. [2020-02-10 19:47:32,561 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3164 transitions. Word has length 25 [2020-02-10 19:47:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:32,561 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3164 transitions. [2020-02-10 19:47:32,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3164 transitions. [2020-02-10 19:47:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:32,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:32,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:32,562 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1489752905, now seen corresponding path program 384 times [2020-02-10 19:47:32,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:32,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947751995] [2020-02-10 19:47:32,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:32,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947751995] [2020-02-10 19:47:32,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:32,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:32,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598968074] [2020-02-10 19:47:32,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:32,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:32,938 INFO L87 Difference]: Start difference. First operand 799 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:47:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:33,071 INFO L93 Difference]: Finished difference Result 1458 states and 5086 transitions. [2020-02-10 19:47:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:33,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:33,075 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 19:47:33,075 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:47:33,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:47:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 785. [2020-02-10 19:47:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:47:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 19:47:33,097 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 19:47:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:33,097 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 19:47:33,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 19:47:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:33,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:33,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:33,099 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash 307500855, now seen corresponding path program 385 times [2020-02-10 19:47:33,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:33,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690959222] [2020-02-10 19:47:33,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:33,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690959222] [2020-02-10 19:47:33,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:33,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:33,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994679567] [2020-02-10 19:47:33,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:33,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:33,468 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:47:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:33,599 INFO L93 Difference]: Finished difference Result 1471 states and 5138 transitions. [2020-02-10 19:47:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:33,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:33,602 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 19:47:33,602 INFO L226 Difference]: Without dead ends: 1458 [2020-02-10 19:47:33,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-02-10 19:47:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 800. [2020-02-10 19:47:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:47:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3185 transitions. [2020-02-10 19:47:33,625 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3185 transitions. Word has length 25 [2020-02-10 19:47:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:33,625 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3185 transitions. [2020-02-10 19:47:33,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3185 transitions. [2020-02-10 19:47:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:33,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:33,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:33,627 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1277752469, now seen corresponding path program 386 times [2020-02-10 19:47:33,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:33,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232738882] [2020-02-10 19:47:33,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:34,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232738882] [2020-02-10 19:47:34,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:34,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:34,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315986907] [2020-02-10 19:47:34,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:34,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:34,005 INFO L87 Difference]: Start difference. First operand 800 states and 3185 transitions. Second operand 10 states. [2020-02-10 19:47:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,139 INFO L93 Difference]: Finished difference Result 1473 states and 5138 transitions. [2020-02-10 19:47:34,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:34,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,143 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 19:47:34,144 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 19:47:34,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 19:47:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-02-10 19:47:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:47:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3174 transitions. [2020-02-10 19:47:34,166 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3174 transitions. Word has length 25 [2020-02-10 19:47:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:34,167 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3174 transitions. [2020-02-10 19:47:34,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3174 transitions. [2020-02-10 19:47:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:34,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:34,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:34,168 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash -135398285, now seen corresponding path program 387 times [2020-02-10 19:47:34,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:34,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088461065] [2020-02-10 19:47:34,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:34,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088461065] [2020-02-10 19:47:34,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:34,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:34,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228407036] [2020-02-10 19:47:34,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:34,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:34,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:34,551 INFO L87 Difference]: Start difference. First operand 796 states and 3174 transitions. Second operand 10 states. [2020-02-10 19:47:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,682 INFO L93 Difference]: Finished difference Result 1472 states and 5136 transitions. [2020-02-10 19:47:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:34,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,685 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 19:47:34,686 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:47:34,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:47:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 800. [2020-02-10 19:47:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:47:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3181 transitions. [2020-02-10 19:47:34,708 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3181 transitions. Word has length 25 [2020-02-10 19:47:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:34,708 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3181 transitions. [2020-02-10 19:47:34,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3181 transitions. [2020-02-10 19:47:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:34,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:34,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:34,710 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 855859537, now seen corresponding path program 388 times [2020-02-10 19:47:34,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:34,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465927129] [2020-02-10 19:47:34,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:35,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465927129] [2020-02-10 19:47:35,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:35,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:35,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507017937] [2020-02-10 19:47:35,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:35,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:35,092 INFO L87 Difference]: Start difference. First operand 800 states and 3181 transitions. Second operand 10 states. [2020-02-10 19:47:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:35,228 INFO L93 Difference]: Finished difference Result 1475 states and 5138 transitions. [2020-02-10 19:47:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:35,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:35,232 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:47:35,232 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 19:47:35,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 19:47:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 796. [2020-02-10 19:47:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:47:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3170 transitions. [2020-02-10 19:47:35,254 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3170 transitions. Word has length 25 [2020-02-10 19:47:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:35,254 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3170 transitions. [2020-02-10 19:47:35,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3170 transitions. [2020-02-10 19:47:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:35,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:35,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:35,256 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:35,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1941973879, now seen corresponding path program 389 times [2020-02-10 19:47:35,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:35,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110797152] [2020-02-10 19:47:35,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:35,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110797152] [2020-02-10 19:47:35,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:35,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:35,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182502281] [2020-02-10 19:47:35,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:35,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:35,661 INFO L87 Difference]: Start difference. First operand 796 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:47:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:35,790 INFO L93 Difference]: Finished difference Result 1478 states and 5146 transitions. [2020-02-10 19:47:35,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:35,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:35,794 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:47:35,794 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 19:47:35,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 19:47:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 802. [2020-02-10 19:47:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:47:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-02-10 19:47:35,817 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-02-10 19:47:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:35,817 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-02-10 19:47:35,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-02-10 19:47:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:35,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:35,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] [2020-02-10 19:47:35,818 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 868888499, now seen corresponding path program 390 times [2020-02-10 19:47:35,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:35,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818137209] [2020-02-10 19:47:35,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:36,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 19:47:36,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818137209] [2020-02-10 19:47:36,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:36,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:36,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241612761] [2020-02-10 19:47:36,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:36,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:36,206 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-02-10 19:47:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:36,353 INFO L93 Difference]: Finished difference Result 1479 states and 5142 transitions. [2020-02-10 19:47:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:36,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:36,357 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 19:47:36,357 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 19:47:36,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 19:47:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-02-10 19:47:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3159 transitions. [2020-02-10 19:47:36,379 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3159 transitions. Word has length 25 [2020-02-10 19:47:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:36,379 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3159 transitions. [2020-02-10 19:47:36,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3159 transitions. [2020-02-10 19:47:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:36,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:36,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:36,381 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:36,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash -537470597, now seen corresponding path program 391 times [2020-02-10 19:47:36,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:36,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352120689] [2020-02-10 19:47:36,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:36,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352120689] [2020-02-10 19:47:36,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:36,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:36,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721689030] [2020-02-10 19:47:36,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:36,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:36,752 INFO L87 Difference]: Start difference. First operand 792 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:47:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:36,893 INFO L93 Difference]: Finished difference Result 1476 states and 5144 transitions. [2020-02-10 19:47:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:36,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:36,897 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 19:47:36,897 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 19:47:36,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 19:47:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 801. [2020-02-10 19:47:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:47:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3184 transitions. [2020-02-10 19:47:36,920 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3184 transitions. Word has length 25 [2020-02-10 19:47:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:36,920 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3184 transitions. [2020-02-10 19:47:36,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3184 transitions. [2020-02-10 19:47:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:36,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:36,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:36,921 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash 432781017, now seen corresponding path program 392 times [2020-02-10 19:47:36,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:36,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201987004] [2020-02-10 19:47:36,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:37,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 19:47:37,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201987004] [2020-02-10 19:47:37,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:37,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:37,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790419892] [2020-02-10 19:47:37,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:37,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:37,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:37,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:37,295 INFO L87 Difference]: Start difference. First operand 801 states and 3184 transitions. Second operand 10 states. [2020-02-10 19:47:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:37,432 INFO L93 Difference]: Finished difference Result 1478 states and 5144 transitions. [2020-02-10 19:47:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:37,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:37,435 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:47:37,435 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:47:37,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:47:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 797. [2020-02-10 19:47:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3173 transitions. [2020-02-10 19:47:37,457 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3173 transitions. Word has length 25 [2020-02-10 19:47:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:37,458 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3173 transitions. [2020-02-10 19:47:37,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3173 transitions. [2020-02-10 19:47:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:37,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:37,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:37,459 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1423268877, now seen corresponding path program 393 times [2020-02-10 19:47:37,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:37,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674889259] [2020-02-10 19:47:37,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:37,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 19:47:37,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674889259] [2020-02-10 19:47:37,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:37,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:37,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55390132] [2020-02-10 19:47:37,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:37,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:37,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:37,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:37,841 INFO L87 Difference]: Start difference. First operand 797 states and 3173 transitions. Second operand 10 states. [2020-02-10 19:47:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:37,995 INFO L93 Difference]: Finished difference Result 1480 states and 5147 transitions. [2020-02-10 19:47:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:37,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:37,998 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 19:47:37,998 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 19:47:37,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 19:47:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 802. [2020-02-10 19:47:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:47:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3182 transitions. [2020-02-10 19:47:38,021 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3182 transitions. Word has length 25 [2020-02-10 19:47:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:38,021 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3182 transitions. [2020-02-10 19:47:38,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3182 transitions. [2020-02-10 19:47:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:38,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:38,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] [2020-02-10 19:47:38,022 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash -411004847, now seen corresponding path program 394 times [2020-02-10 19:47:38,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:38,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879579780] [2020-02-10 19:47:38,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:38,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879579780] [2020-02-10 19:47:38,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:38,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73036398] [2020-02-10 19:47:38,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:38,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:38,422 INFO L87 Difference]: Start difference. First operand 802 states and 3182 transitions. Second operand 10 states. [2020-02-10 19:47:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:38,537 INFO L93 Difference]: Finished difference Result 1485 states and 5152 transitions. [2020-02-10 19:47:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:38,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:38,540 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 19:47:38,540 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 19:47:38,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 19:47:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 797. [2020-02-10 19:47:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:47:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 19:47:38,565 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 19:47:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:38,566 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 19:47:38,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 19:47:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:38,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:38,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:38,567 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1748194875, now seen corresponding path program 395 times [2020-02-10 19:47:38,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:38,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327995106] [2020-02-10 19:47:38,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:38,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327995106] [2020-02-10 19:47:38,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:38,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421708419] [2020-02-10 19:47:38,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:38,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:38,954 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:47:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,095 INFO L93 Difference]: Finished difference Result 1486 states and 5156 transitions. [2020-02-10 19:47:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:39,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,099 INFO L225 Difference]: With dead ends: 1486 [2020-02-10 19:47:39,099 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 19:47:39,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 19:47:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-02-10 19:47:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:47:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3181 transitions. [2020-02-10 19:47:39,122 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3181 transitions. Word has length 25 [2020-02-10 19:47:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,122 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3181 transitions. [2020-02-10 19:47:39,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3181 transitions. [2020-02-10 19:47:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:39,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,123 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:39,123 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash -397975885, now seen corresponding path program 396 times [2020-02-10 19:47:39,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088861930] [2020-02-10 19:47:39,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:39,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 19:47:39,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088861930] [2020-02-10 19:47:39,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:39,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:39,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624963126] [2020-02-10 19:47:39,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:39,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:39,528 INFO L87 Difference]: Start difference. First operand 804 states and 3181 transitions. Second operand 10 states. [2020-02-10 19:47:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,675 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-02-10 19:47:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:39,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,679 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 19:47:39,679 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:47:39,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:47:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 792. [2020-02-10 19:47:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-02-10 19:47:39,702 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-02-10 19:47:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,702 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-02-10 19:47:39,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-02-10 19:47:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:39,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:39,703 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1825341189, now seen corresponding path program 397 times [2020-02-10 19:47:39,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035610476] [2020-02-10 19:47:39,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:40,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 19:47:40,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035610476] [2020-02-10 19:47:40,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:40,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:40,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941909629] [2020-02-10 19:47:40,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:40,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:40,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:40,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:40,083 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:47:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:40,218 INFO L93 Difference]: Finished difference Result 1481 states and 5149 transitions. [2020-02-10 19:47:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:40,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:40,222 INFO L225 Difference]: With dead ends: 1481 [2020-02-10 19:47:40,222 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 19:47:40,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 19:47:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 802. [2020-02-10 19:47:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:47:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-02-10 19:47:40,244 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-02-10 19:47:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:40,244 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-02-10 19:47:40,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-02-10 19:47:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:40,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:40,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:40,246 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -834083367, now seen corresponding path program 398 times [2020-02-10 19:47:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:40,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270678042] [2020-02-10 19:47:40,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:40,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270678042] [2020-02-10 19:47:40,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:40,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:40,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97920491] [2020-02-10 19:47:40,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:40,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:40,628 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-02-10 19:47:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:40,767 INFO L93 Difference]: Finished difference Result 1484 states and 5151 transitions. [2020-02-10 19:47:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:40,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:40,770 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 19:47:40,770 INFO L226 Difference]: Without dead ends: 1464 [2020-02-10 19:47:40,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-02-10 19:47:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 798. [2020-02-10 19:47:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:47:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-02-10 19:47:40,793 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-02-10 19:47:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:40,793 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-02-10 19:47:40,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-02-10 19:47:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:40,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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] [2020-02-10 19:47:40,795 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2026726967, now seen corresponding path program 399 times [2020-02-10 19:47:40,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:40,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009257521] [2020-02-10 19:47:40,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:41,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 19:47:41,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009257521] [2020-02-10 19:47:41,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:41,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:41,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659882161] [2020-02-10 19:47:41,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:41,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:41,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:41,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:41,181 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:47:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:41,320 INFO L93 Difference]: Finished difference Result 1484 states and 5150 transitions. [2020-02-10 19:47:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:41,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:41,323 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 19:47:41,324 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 19:47:41,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 19:47:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 803. [2020-02-10 19:47:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:47:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3179 transitions. [2020-02-10 19:47:41,346 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3179 transitions. Word has length 25 [2020-02-10 19:47:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:41,346 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3179 transitions. [2020-02-10 19:47:41,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3179 transitions. [2020-02-10 19:47:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:41,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:41,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:41,347 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1255976299, now seen corresponding path program 400 times [2020-02-10 19:47:41,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:41,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871541905] [2020-02-10 19:47:41,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871541905] [2020-02-10 19:47:41,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:41,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:41,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174051340] [2020-02-10 19:47:41,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:41,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:41,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:41,744 INFO L87 Difference]: Start difference. First operand 803 states and 3179 transitions. Second operand 10 states. [2020-02-10 19:47:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:41,861 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-02-10 19:47:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:41,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:41,864 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 19:47:41,865 INFO L226 Difference]: Without dead ends: 1466 [2020-02-10 19:47:41,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-02-10 19:47:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 798. [2020-02-10 19:47:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:47:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3165 transitions. [2020-02-10 19:47:41,887 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3165 transitions. Word has length 25 [2020-02-10 19:47:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:41,887 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3165 transitions. [2020-02-10 19:47:41,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3165 transitions. [2020-02-10 19:47:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:41,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:41,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:41,888 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 481330491, now seen corresponding path program 401 times [2020-02-10 19:47:41,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:41,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831925570] [2020-02-10 19:47:41,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:42,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831925570] [2020-02-10 19:47:42,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:42,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:42,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167209926] [2020-02-10 19:47:42,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:42,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:42,282 INFO L87 Difference]: Start difference. First operand 798 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:47:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:42,465 INFO L93 Difference]: Finished difference Result 1494 states and 5167 transitions. [2020-02-10 19:47:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:42,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:42,469 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 19:47:42,469 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 19:47:42,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 19:47:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 807. [2020-02-10 19:47:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:47:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3181 transitions. [2020-02-10 19:47:42,492 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3181 transitions. Word has length 25 [2020-02-10 19:47:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:42,492 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3181 transitions. [2020-02-10 19:47:42,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3181 transitions. [2020-02-10 19:47:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:42,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:42,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:42,493 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash -591754889, now seen corresponding path program 402 times [2020-02-10 19:47:42,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:42,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374718876] [2020-02-10 19:47:42,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:42,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374718876] [2020-02-10 19:47:42,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:42,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:42,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568386805] [2020-02-10 19:47:42,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:42,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:42,893 INFO L87 Difference]: Start difference. First operand 807 states and 3181 transitions. Second operand 10 states. [2020-02-10 19:47:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:43,066 INFO L93 Difference]: Finished difference Result 1496 states and 5163 transitions. [2020-02-10 19:47:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:43,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:43,070 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 19:47:43,070 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 19:47:43,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 19:47:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 792. [2020-02-10 19:47:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:47:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3148 transitions. [2020-02-10 19:47:43,092 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3148 transitions. Word has length 25 [2020-02-10 19:47:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:43,092 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3148 transitions. [2020-02-10 19:47:43,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3148 transitions. [2020-02-10 19:47:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:43,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:43,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] [2020-02-10 19:47:43,094 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -229869483, now seen corresponding path program 403 times [2020-02-10 19:47:43,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:43,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717694258] [2020-02-10 19:47:43,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:43,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717694258] [2020-02-10 19:47:43,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:43,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:43,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787924722] [2020-02-10 19:47:43,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:43,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:43,480 INFO L87 Difference]: Start difference. First operand 792 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:47:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:43,632 INFO L93 Difference]: Finished difference Result 1496 states and 5182 transitions. [2020-02-10 19:47:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:43,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:43,635 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 19:47:43,635 INFO L226 Difference]: Without dead ends: 1481 [2020-02-10 19:47:43,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-02-10 19:47:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 807. [2020-02-10 19:47:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:47:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3188 transitions. [2020-02-10 19:47:43,658 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3188 transitions. Word has length 25 [2020-02-10 19:47:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:43,658 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3188 transitions. [2020-02-10 19:47:43,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3188 transitions. [2020-02-10 19:47:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:43,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:43,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:43,659 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954863, now seen corresponding path program 404 times [2020-02-10 19:47:43,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:43,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033963974] [2020-02-10 19:47:43,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:44,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033963974] [2020-02-10 19:47:44,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:44,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:44,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140115419] [2020-02-10 19:47:44,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:44,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:44,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:44,055 INFO L87 Difference]: Start difference. First operand 807 states and 3188 transitions. Second operand 10 states. [2020-02-10 19:47:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:44,194 INFO L93 Difference]: Finished difference Result 1497 states and 5178 transitions. [2020-02-10 19:47:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:44,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:44,198 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 19:47:44,198 INFO L226 Difference]: Without dead ends: 1475 [2020-02-10 19:47:44,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-02-10 19:47:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 801. [2020-02-10 19:47:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:47:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3171 transitions. [2020-02-10 19:47:44,221 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3171 transitions. Word has length 25 [2020-02-10 19:47:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:44,221 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3171 transitions. [2020-02-10 19:47:44,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3171 transitions. [2020-02-10 19:47:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:44,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:44,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:44,223 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:44,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:44,223 INFO L82 PathProgramCache]: Analyzing trace with hash 864222105, now seen corresponding path program 405 times [2020-02-10 19:47:44,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:44,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527584245] [2020-02-10 19:47:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:44,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527584245] [2020-02-10 19:47:44,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:44,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:44,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677241994] [2020-02-10 19:47:44,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:44,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:44,616 INFO L87 Difference]: Start difference. First operand 801 states and 3171 transitions. Second operand 10 states. [2020-02-10 19:47:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:44,754 INFO L93 Difference]: Finished difference Result 1499 states and 5181 transitions. [2020-02-10 19:47:44,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:44,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:44,758 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 19:47:44,758 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 19:47:44,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 19:47:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 808. [2020-02-10 19:47:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 19:47:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3184 transitions. [2020-02-10 19:47:44,781 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3184 transitions. Word has length 25 [2020-02-10 19:47:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:44,782 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3184 transitions. [2020-02-10 19:47:44,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3184 transitions. [2020-02-10 19:47:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:44,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:44,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:44,783 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1281948655, now seen corresponding path program 406 times [2020-02-10 19:47:44,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:44,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059605527] [2020-02-10 19:47:44,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:45,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 19:47:45,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059605527] [2020-02-10 19:47:45,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:45,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:45,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408267834] [2020-02-10 19:47:45,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:45,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:45,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:45,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:45,180 INFO L87 Difference]: Start difference. First operand 808 states and 3184 transitions. Second operand 10 states. [2020-02-10 19:47:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:45,293 INFO L93 Difference]: Finished difference Result 1502 states and 5180 transitions. [2020-02-10 19:47:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:45,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:45,297 INFO L225 Difference]: With dead ends: 1502 [2020-02-10 19:47:45,298 INFO L226 Difference]: Without dead ends: 1477 [2020-02-10 19:47:45,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-02-10 19:47:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 801. [2020-02-10 19:47:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:47:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3164 transitions. [2020-02-10 19:47:45,321 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3164 transitions. Word has length 25 [2020-02-10 19:47:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:45,321 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3164 transitions. [2020-02-10 19:47:45,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3164 transitions. [2020-02-10 19:47:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:45,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:45,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:45,322 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:45,322 INFO L82 PathProgramCache]: Analyzing trace with hash 885228313, now seen corresponding path program 407 times [2020-02-10 19:47:45,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:45,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690989607] [2020-02-10 19:47:45,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:45,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690989607] [2020-02-10 19:47:45,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:45,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:45,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907830375] [2020-02-10 19:47:45,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:45,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:45,722 INFO L87 Difference]: Start difference. First operand 801 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:47:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:45,905 INFO L93 Difference]: Finished difference Result 1503 states and 5182 transitions. [2020-02-10 19:47:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:45,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:45,909 INFO L225 Difference]: With dead ends: 1503 [2020-02-10 19:47:45,909 INFO L226 Difference]: Without dead ends: 1487 [2020-02-10 19:47:45,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2020-02-10 19:47:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 810. [2020-02-10 19:47:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 19:47:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3180 transitions. [2020-02-10 19:47:45,933 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3180 transitions. Word has length 25 [2020-02-10 19:47:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:45,933 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3180 transitions. [2020-02-10 19:47:45,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3180 transitions. [2020-02-10 19:47:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:45,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:45,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:45,934 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash -187857067, now seen corresponding path program 408 times [2020-02-10 19:47:45,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:45,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619028719] [2020-02-10 19:47:45,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,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 19:47:46,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619028719] [2020-02-10 19:47:46,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:46,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461751965] [2020-02-10 19:47:46,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:46,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:46,338 INFO L87 Difference]: Start difference. First operand 810 states and 3180 transitions. Second operand 10 states. [2020-02-10 19:47:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:46,486 INFO L93 Difference]: Finished difference Result 1505 states and 5178 transitions. [2020-02-10 19:47:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:46,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:46,490 INFO L225 Difference]: With dead ends: 1505 [2020-02-10 19:47:46,490 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 19:47:46,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 19:47:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 785. [2020-02-10 19:47:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:47:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3128 transitions. [2020-02-10 19:47:46,514 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3128 transitions. Word has length 25 [2020-02-10 19:47:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:46,514 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3128 transitions. [2020-02-10 19:47:46,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3128 transitions. [2020-02-10 19:47:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:46,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:46,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] [2020-02-10 19:47:46,515 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash -327140489, now seen corresponding path program 409 times [2020-02-10 19:47:46,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:46,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807169147] [2020-02-10 19:47:46,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:46,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807169147] [2020-02-10 19:47:46,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:46,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849962732] [2020-02-10 19:47:46,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:46,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:46,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:46,907 INFO L87 Difference]: Start difference. First operand 785 states and 3128 transitions. Second operand 10 states. [2020-02-10 19:47:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:47,066 INFO L93 Difference]: Finished difference Result 1456 states and 5096 transitions. [2020-02-10 19:47:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:47,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:47,070 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 19:47:47,070 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 19:47:47,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 19:47:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 798. [2020-02-10 19:47:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:47:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3173 transitions. [2020-02-10 19:47:47,092 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3173 transitions. Word has length 25 [2020-02-10 19:47:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:47,092 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3173 transitions. [2020-02-10 19:47:47,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3173 transitions. [2020-02-10 19:47:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:47,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:47,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] [2020-02-10 19:47:47,094 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:47,094 INFO L82 PathProgramCache]: Analyzing trace with hash 643111125, now seen corresponding path program 410 times [2020-02-10 19:47:47,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:47,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409888341] [2020-02-10 19:47:47,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:47,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409888341] [2020-02-10 19:47:47,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:47,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:47,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088717579] [2020-02-10 19:47:47,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:47,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:47,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:47,478 INFO L87 Difference]: Start difference. First operand 798 states and 3173 transitions. Second operand 10 states. [2020-02-10 19:47:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:47,617 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 19:47:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:47,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:47,620 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 19:47:47,621 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 19:47:47,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 19:47:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 794. [2020-02-10 19:47:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 19:47:47,643 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 19:47:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:47,644 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 19:47:47,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 19:47:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:47,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:47,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:47,645 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1155994449, now seen corresponding path program 411 times [2020-02-10 19:47:47,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:47,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065667986] [2020-02-10 19:47:47,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:48,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065667986] [2020-02-10 19:47:48,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:48,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:48,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514972489] [2020-02-10 19:47:48,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:48,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:48,037 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:47:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:48,180 INFO L93 Difference]: Finished difference Result 1455 states and 5090 transitions. [2020-02-10 19:47:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:48,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:48,183 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 19:47:48,183 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 19:47:48,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 19:47:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 798. [2020-02-10 19:47:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:47:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-02-10 19:47:48,205 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-02-10 19:47:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:48,205 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-02-10 19:47:48,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-02-10 19:47:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:48,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:48,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:48,207 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2137211921, now seen corresponding path program 412 times [2020-02-10 19:47:48,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:48,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896894856] [2020-02-10 19:47:48,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:48,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896894856] [2020-02-10 19:47:48,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:48,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:48,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275076276] [2020-02-10 19:47:48,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:48,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:48,591 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:47:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:48,736 INFO L93 Difference]: Finished difference Result 1456 states and 5088 transitions. [2020-02-10 19:47:48,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:48,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:48,740 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 19:47:48,740 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 19:47:48,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 19:47:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-02-10 19:47:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:47:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-02-10 19:47:48,763 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-02-10 19:47:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:48,763 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-02-10 19:47:48,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-02-10 19:47:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:48,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:48,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] [2020-02-10 19:47:48,765 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:48,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1632928759, now seen corresponding path program 413 times [2020-02-10 19:47:48,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:48,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659006616] [2020-02-10 19:47:48,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:49,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659006616] [2020-02-10 19:47:49,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:49,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:49,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261633269] [2020-02-10 19:47:49,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:49,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:49,160 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:47:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:49,298 INFO L93 Difference]: Finished difference Result 1460 states and 5097 transitions. [2020-02-10 19:47:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:49,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:49,302 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 19:47:49,302 INFO L226 Difference]: Without dead ends: 1445 [2020-02-10 19:47:49,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-02-10 19:47:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 799. [2020-02-10 19:47:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:47:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 19:47:49,325 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 19:47:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:49,325 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 19:47:49,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 19:47:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:49,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:49,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:49,326 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2124182959, now seen corresponding path program 414 times [2020-02-10 19:47:49,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:49,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014908817] [2020-02-10 19:47:49,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:49,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014908817] [2020-02-10 19:47:49,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:49,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:49,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318634864] [2020-02-10 19:47:49,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:49,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:49,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:49,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:49,721 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:47:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:49,854 INFO L93 Difference]: Finished difference Result 1459 states and 5090 transitions. [2020-02-10 19:47:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:49,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:49,858 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 19:47:49,858 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:47:49,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:47:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 790. [2020-02-10 19:47:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-02-10 19:47:49,881 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-02-10 19:47:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:49,881 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-02-10 19:47:49,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-02-10 19:47:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:49,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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] [2020-02-10 19:47:49,882 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash -749626215, now seen corresponding path program 415 times [2020-02-10 19:47:49,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:49,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220992076] [2020-02-10 19:47:49,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:50,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220992076] [2020-02-10 19:47:50,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:50,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:50,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719777074] [2020-02-10 19:47:50,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:50,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:50,281 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:47:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:50,407 INFO L93 Difference]: Finished difference Result 1464 states and 5109 transitions. [2020-02-10 19:47:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:50,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:50,411 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 19:47:50,411 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 19:47:50,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 19:47:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-02-10 19:47:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:47:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3172 transitions. [2020-02-10 19:47:50,434 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3172 transitions. Word has length 25 [2020-02-10 19:47:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:50,435 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3172 transitions. [2020-02-10 19:47:50,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3172 transitions. [2020-02-10 19:47:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:50,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:50,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:50,436 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash 220625399, now seen corresponding path program 416 times [2020-02-10 19:47:50,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:50,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825547979] [2020-02-10 19:47:50,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:50,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 19:47:50,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825547979] [2020-02-10 19:47:50,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:50,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:50,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447106684] [2020-02-10 19:47:50,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:50,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:50,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:50,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:50,814 INFO L87 Difference]: Start difference. First operand 799 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:47:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:50,954 INFO L93 Difference]: Finished difference Result 1466 states and 5109 transitions. [2020-02-10 19:47:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:50,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:50,958 INFO L225 Difference]: With dead ends: 1466 [2020-02-10 19:47:50,958 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 19:47:50,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 19:47:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-02-10 19:47:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-02-10 19:47:50,981 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-02-10 19:47:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:50,982 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-02-10 19:47:50,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-02-10 19:47:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:50,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:50,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:50,983 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1635424495, now seen corresponding path program 417 times [2020-02-10 19:47:50,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:50,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128075241] [2020-02-10 19:47:50,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:51,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128075241] [2020-02-10 19:47:51,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:51,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:51,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94689906] [2020-02-10 19:47:51,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:51,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:51,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:51,343 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:47:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:51,460 INFO L93 Difference]: Finished difference Result 1468 states and 5112 transitions. [2020-02-10 19:47:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:51,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:51,464 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 19:47:51,464 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 19:47:51,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 19:47:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 800. [2020-02-10 19:47:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:47:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3170 transitions. [2020-02-10 19:47:51,486 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3170 transitions. Word has length 25 [2020-02-10 19:47:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:51,486 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3170 transitions. [2020-02-10 19:47:51,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3170 transitions. [2020-02-10 19:47:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:51,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:51,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:51,488 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash -623160465, now seen corresponding path program 418 times [2020-02-10 19:47:51,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:51,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817847520] [2020-02-10 19:47:51,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:51,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817847520] [2020-02-10 19:47:51,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:51,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:51,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829914157] [2020-02-10 19:47:51,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:51,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:51,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:51,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:51,875 INFO L87 Difference]: Start difference. First operand 800 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:47:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:52,007 INFO L93 Difference]: Finished difference Result 1473 states and 5117 transitions. [2020-02-10 19:47:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:52,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:52,011 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 19:47:52,011 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 19:47:52,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 19:47:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2020-02-10 19:47:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 19:47:52,034 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 19:47:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:52,034 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 19:47:52,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 19:47:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:52,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:52,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] [2020-02-10 19:47:52,036 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1536039257, now seen corresponding path program 419 times [2020-02-10 19:47:52,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:52,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087243369] [2020-02-10 19:47:52,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:52,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087243369] [2020-02-10 19:47:52,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:52,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:52,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974119624] [2020-02-10 19:47:52,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:52,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:52,418 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:47:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:52,551 INFO L93 Difference]: Finished difference Result 1474 states and 5121 transitions. [2020-02-10 19:47:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:52,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:52,555 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 19:47:52,555 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:47:52,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:47:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 802. [2020-02-10 19:47:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:47:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3169 transitions. [2020-02-10 19:47:52,579 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3169 transitions. Word has length 25 [2020-02-10 19:47:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:52,579 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3169 transitions. [2020-02-10 19:47:52,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3169 transitions. [2020-02-10 19:47:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:52,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:52,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:52,580 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash -610131503, now seen corresponding path program 420 times [2020-02-10 19:47:52,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:52,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997810131] [2020-02-10 19:47:52,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:52,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997810131] [2020-02-10 19:47:52,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:52,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:52,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101736321] [2020-02-10 19:47:52,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:52,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:52,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:52,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:52,974 INFO L87 Difference]: Start difference. First operand 802 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:47:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:53,096 INFO L93 Difference]: Finished difference Result 1477 states and 5120 transitions. [2020-02-10 19:47:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:53,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:53,099 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 19:47:53,100 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 19:47:53,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 19:47:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 790. [2020-02-10 19:47:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3142 transitions. [2020-02-10 19:47:53,123 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3142 transitions. Word has length 25 [2020-02-10 19:47:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:53,123 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3142 transitions. [2020-02-10 19:47:53,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3142 transitions. [2020-02-10 19:47:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:53,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:53,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:53,124 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -533948455, now seen corresponding path program 421 times [2020-02-10 19:47:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805884714] [2020-02-10 19:47:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:53,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 19:47:53,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805884714] [2020-02-10 19:47:53,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:53,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:53,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177087427] [2020-02-10 19:47:53,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:53,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:53,528 INFO L87 Difference]: Start difference. First operand 790 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:47:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:53,664 INFO L93 Difference]: Finished difference Result 1461 states and 5097 transitions. [2020-02-10 19:47:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:53,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:53,667 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 19:47:53,668 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 19:47:53,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 19:47:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 799. [2020-02-10 19:47:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:47:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 19:47:53,690 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 19:47:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:53,690 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 19:47:53,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 19:47:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:53,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:53,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:53,692 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 467812471, now seen corresponding path program 422 times [2020-02-10 19:47:53,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:53,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289278687] [2020-02-10 19:47:53,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:54,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289278687] [2020-02-10 19:47:54,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:54,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707742705] [2020-02-10 19:47:54,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:54,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:54,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:54,077 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:47:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:54,221 INFO L93 Difference]: Finished difference Result 1462 states and 5095 transitions. [2020-02-10 19:47:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:54,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:54,225 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 19:47:54,225 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:47:54,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:47:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 795. [2020-02-10 19:47:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 19:47:54,248 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 19:47:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:54,248 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 19:47:54,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 19:47:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:54,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:54,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:54,249 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1392085623, now seen corresponding path program 423 times [2020-02-10 19:47:54,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:54,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962462035] [2020-02-10 19:47:54,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:54,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962462035] [2020-02-10 19:47:54,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:54,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582990449] [2020-02-10 19:47:54,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:54,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:54,628 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:47:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:54,755 INFO L93 Difference]: Finished difference Result 1466 states and 5102 transitions. [2020-02-10 19:47:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:54,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:54,759 INFO L225 Difference]: With dead ends: 1466 [2020-02-10 19:47:54,759 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 19:47:54,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 19:47:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-02-10 19:47:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:47:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-02-10 19:47:54,782 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-02-10 19:47:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:54,782 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-02-10 19:47:54,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-02-10 19:47:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:54,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:54,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:54,783 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1890617643, now seen corresponding path program 424 times [2020-02-10 19:47:54,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:54,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450040216] [2020-02-10 19:47:54,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:55,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450040216] [2020-02-10 19:47:55,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:55,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:55,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617905719] [2020-02-10 19:47:55,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:55,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:55,167 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:47:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:55,276 INFO L93 Difference]: Finished difference Result 1471 states and 5107 transitions. [2020-02-10 19:47:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:55,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:55,280 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 19:47:55,280 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 19:47:55,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 19:47:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 795. [2020-02-10 19:47:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:47:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 19:47:55,302 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 19:47:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:55,303 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 19:47:55,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 19:47:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:55,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:55,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:55,304 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1783226329, now seen corresponding path program 425 times [2020-02-10 19:47:55,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:55,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886730459] [2020-02-10 19:47:55,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:55,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886730459] [2020-02-10 19:47:55,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:55,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:55,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480275402] [2020-02-10 19:47:55,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:55,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:55,690 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:47:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:55,842 INFO L93 Difference]: Finished difference Result 1469 states and 5104 transitions. [2020-02-10 19:47:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:55,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:55,846 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 19:47:55,846 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 19:47:55,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 19:47:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 801. [2020-02-10 19:47:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:47:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-02-10 19:47:55,868 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-02-10 19:47:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:55,869 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-02-10 19:47:55,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-02-10 19:47:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:55,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:55,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:55,870 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -900800009, now seen corresponding path program 426 times [2020-02-10 19:47:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:55,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716459501] [2020-02-10 19:47:55,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:56,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716459501] [2020-02-10 19:47:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:56,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:56,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85589789] [2020-02-10 19:47:56,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:56,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:56,260 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:47:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:56,364 INFO L93 Difference]: Finished difference Result 1473 states and 5106 transitions. [2020-02-10 19:47:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:56,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:56,368 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 19:47:56,368 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:47:56,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:47:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 790. [2020-02-10 19:47:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:47:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-02-10 19:47:56,391 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-02-10 19:47:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:56,391 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-02-10 19:47:56,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-02-10 19:47:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:56,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:56,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:56,393 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -538914603, now seen corresponding path program 427 times [2020-02-10 19:47:56,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:56,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815280601] [2020-02-10 19:47:56,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:56,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815280601] [2020-02-10 19:47:56,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:56,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:56,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156920682] [2020-02-10 19:47:56,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:56,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:56,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:56,776 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:47:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:56,941 INFO L93 Difference]: Finished difference Result 1472 states and 5120 transitions. [2020-02-10 19:47:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:56,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:56,945 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 19:47:56,945 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 19:47:56,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 19:47:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 801. [2020-02-10 19:47:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:47:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3168 transitions. [2020-02-10 19:47:56,967 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3168 transitions. Word has length 25 [2020-02-10 19:47:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:56,967 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3168 transitions. [2020-02-10 19:47:56,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3168 transitions. [2020-02-10 19:47:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:56,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:56,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:56,968 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1059025, now seen corresponding path program 428 times [2020-02-10 19:47:56,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:56,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716046079] [2020-02-10 19:47:56,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:57,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716046079] [2020-02-10 19:47:57,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:57,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:57,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821556977] [2020-02-10 19:47:57,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:57,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:57,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:57,348 INFO L87 Difference]: Start difference. First operand 801 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:47:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:57,480 INFO L93 Difference]: Finished difference Result 1471 states and 5113 transitions. [2020-02-10 19:47:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:57,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:57,484 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 19:47:57,484 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 19:47:57,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 19:47:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 796. [2020-02-10 19:47:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:47:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-02-10 19:47:57,507 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-02-10 19:47:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:57,507 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-02-10 19:47:57,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-02-10 19:47:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:57,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:57,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:57,509 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2139352457, now seen corresponding path program 429 times [2020-02-10 19:47:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734409731] [2020-02-10 19:47:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:57,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734409731] [2020-02-10 19:47:57,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:57,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:57,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052424763] [2020-02-10 19:47:57,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:57,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:57,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:57,887 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:47:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:58,030 INFO L93 Difference]: Finished difference Result 1478 states and 5127 transitions. [2020-02-10 19:47:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:58,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:58,033 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:47:58,033 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 19:47:58,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 19:47:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 803. [2020-02-10 19:47:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:47:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-02-10 19:47:58,055 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-02-10 19:47:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:58,056 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-02-10 19:47:58,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-02-10 19:47:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:58,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:58,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] [2020-02-10 19:47:58,057 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 9444079, now seen corresponding path program 430 times [2020-02-10 19:47:58,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:58,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444673200] [2020-02-10 19:47:58,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:58,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444673200] [2020-02-10 19:47:58,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:58,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:58,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606653883] [2020-02-10 19:47:58,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:58,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:58,452 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:47:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:58,564 INFO L93 Difference]: Finished difference Result 1481 states and 5126 transitions. [2020-02-10 19:47:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:58,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:58,568 INFO L225 Difference]: With dead ends: 1481 [2020-02-10 19:47:58,568 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 19:47:58,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 19:47:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 796. [2020-02-10 19:47:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:47:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 19:47:58,591 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 19:47:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:58,591 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 19:47:58,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 19:47:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:58,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:58,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:58,592 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2107843145, now seen corresponding path program 431 times [2020-02-10 19:47:58,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:58,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484306422] [2020-02-10 19:47:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:58,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484306422] [2020-02-10 19:47:58,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:58,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:58,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832615528] [2020-02-10 19:47:58,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:58,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:58,974 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:47:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:59,098 INFO L93 Difference]: Finished difference Result 1475 states and 5114 transitions. [2020-02-10 19:47:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:59,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:59,102 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:47:59,102 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 19:47:59,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 19:47:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-02-10 19:47:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:47:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-02-10 19:47:59,124 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-02-10 19:47:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:59,124 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-02-10 19:47:59,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-02-10 19:47:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:59,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:59,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:59,126 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash -496902187, now seen corresponding path program 432 times [2020-02-10 19:47:59,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:59,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525592521] [2020-02-10 19:47:59,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:59,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525592521] [2020-02-10 19:47:59,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:59,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:47:59,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019561283] [2020-02-10 19:47:59,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:47:59,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:47:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:47:59,514 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:47:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:59,626 INFO L93 Difference]: Finished difference Result 1479 states and 5116 transitions. [2020-02-10 19:47:59,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:47:59,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:47:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:59,629 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 19:47:59,629 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:47:59,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:47:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 785. [2020-02-10 19:47:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:47:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3123 transitions. [2020-02-10 19:47:59,651 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3123 transitions. Word has length 25 [2020-02-10 19:47:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:59,652 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3123 transitions. [2020-02-10 19:47:59,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:47:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3123 transitions. [2020-02-10 19:47:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:47:59,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:59,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:59,653 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2039322317, now seen corresponding path program 433 times [2020-02-10 19:47:59,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:59,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455759298] [2020-02-10 19:47:59,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:00,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455759298] [2020-02-10 19:48:00,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:00,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:00,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602773553] [2020-02-10 19:48:00,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:00,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:00,029 INFO L87 Difference]: Start difference. First operand 785 states and 3123 transitions. Second operand 10 states. [2020-02-10 19:48:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:00,181 INFO L93 Difference]: Finished difference Result 1464 states and 5108 transitions. [2020-02-10 19:48:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:00,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:00,185 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 19:48:00,185 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 19:48:00,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 19:48:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-02-10 19:48:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:48:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3171 transitions. [2020-02-10 19:48:00,207 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3171 transitions. Word has length 25 [2020-02-10 19:48:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:00,207 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3171 transitions. [2020-02-10 19:48:00,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3171 transitions. [2020-02-10 19:48:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:00,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:00,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:00,209 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:00,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1048064495, now seen corresponding path program 434 times [2020-02-10 19:48:00,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:00,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100275467] [2020-02-10 19:48:00,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:00,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100275467] [2020-02-10 19:48:00,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:00,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:00,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209912859] [2020-02-10 19:48:00,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:00,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:00,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:00,590 INFO L87 Difference]: Start difference. First operand 799 states and 3171 transitions. Second operand 10 states. [2020-02-10 19:48:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:00,744 INFO L93 Difference]: Finished difference Result 1467 states and 5110 transitions. [2020-02-10 19:48:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:00,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:00,748 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:48:00,748 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 19:48:00,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 19:48:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-02-10 19:48:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:48:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3160 transitions. [2020-02-10 19:48:00,771 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3160 transitions. Word has length 25 [2020-02-10 19:48:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:00,771 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3160 transitions. [2020-02-10 19:48:00,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3160 transitions. [2020-02-10 19:48:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:00,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:00,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:00,772 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash -113288239, now seen corresponding path program 435 times [2020-02-10 19:48:00,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:00,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198848181] [2020-02-10 19:48:00,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:01,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 19:48:01,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198848181] [2020-02-10 19:48:01,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:01,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:01,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926220182] [2020-02-10 19:48:01,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:01,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:01,154 INFO L87 Difference]: Start difference. First operand 795 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:48:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:01,321 INFO L93 Difference]: Finished difference Result 1462 states and 5100 transitions. [2020-02-10 19:48:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:01,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:01,324 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 19:48:01,324 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 19:48:01,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 19:48:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 799. [2020-02-10 19:48:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:48:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 19:48:01,348 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 19:48:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,348 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 19:48:01,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 19:48:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:01,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,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] [2020-02-10 19:48:01,349 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash 888472687, now seen corresponding path program 436 times [2020-02-10 19:48:01,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884450670] [2020-02-10 19:48:01,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:01,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884450670] [2020-02-10 19:48:01,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:01,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:01,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55956964] [2020-02-10 19:48:01,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:01,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:01,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:01,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:01,731 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:48:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:01,898 INFO L93 Difference]: Finished difference Result 1463 states and 5098 transitions. [2020-02-10 19:48:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:01,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:01,902 INFO L225 Difference]: With dead ends: 1463 [2020-02-10 19:48:01,903 INFO L226 Difference]: Without dead ends: 1445 [2020-02-10 19:48:01,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-02-10 19:48:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 795. [2020-02-10 19:48:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:48:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 19:48:01,925 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 19:48:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,926 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 19:48:01,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 19:48:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:01,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:01,927 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash -58246861, now seen corresponding path program 437 times [2020-02-10 19:48:01,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188627209] [2020-02-10 19:48:01,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:02,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188627209] [2020-02-10 19:48:02,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:02,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:02,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309576847] [2020-02-10 19:48:02,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:02,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:02,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:02,301 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:48:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:02,426 INFO L93 Difference]: Finished difference Result 1469 states and 5111 transitions. [2020-02-10 19:48:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:02,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:02,429 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 19:48:02,429 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 19:48:02,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 19:48:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-02-10 19:48:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:48:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-02-10 19:48:02,452 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-02-10 19:48:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:02,452 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-02-10 19:48:02,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-02-10 19:48:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:02,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:02,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:02,454 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1552694097, now seen corresponding path program 438 times [2020-02-10 19:48:02,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:02,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015694648] [2020-02-10 19:48:02,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:02,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015694648] [2020-02-10 19:48:02,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:02,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:02,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140412653] [2020-02-10 19:48:02,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:02,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:02,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:02,826 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:48:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:02,969 INFO L93 Difference]: Finished difference Result 1467 states and 5102 transitions. [2020-02-10 19:48:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:02,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:02,972 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:48:02,972 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:48:02,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:48:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 791. [2020-02-10 19:48:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 19:48:02,994 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:02,995 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 19:48:02,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 19:48:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:02,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:02,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:02,996 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1833159253, now seen corresponding path program 439 times [2020-02-10 19:48:02,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:02,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132231111] [2020-02-10 19:48:02,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:03,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 19:48:03,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132231111] [2020-02-10 19:48:03,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:03,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:03,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95643760] [2020-02-10 19:48:03,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:03,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:03,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:03,380 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:03,514 INFO L93 Difference]: Finished difference Result 1475 states and 5127 transitions. [2020-02-10 19:48:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:03,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:03,518 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:48:03,518 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 19:48:03,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 19:48:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 801. [2020-02-10 19:48:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:48:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3172 transitions. [2020-02-10 19:48:03,542 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3172 transitions. Word has length 25 [2020-02-10 19:48:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:03,542 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3172 transitions. [2020-02-10 19:48:03,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3172 transitions. [2020-02-10 19:48:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:03,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:03,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:03,543 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1470550221, now seen corresponding path program 440 times [2020-02-10 19:48:03,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:03,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531041748] [2020-02-10 19:48:03,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:03,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531041748] [2020-02-10 19:48:03,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:03,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:03,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070318591] [2020-02-10 19:48:03,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:03,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:03,950 INFO L87 Difference]: Start difference. First operand 801 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:48:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:04,085 INFO L93 Difference]: Finished difference Result 1478 states and 5129 transitions. [2020-02-10 19:48:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:04,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:04,089 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:48:04,089 INFO L226 Difference]: Without dead ends: 1458 [2020-02-10 19:48:04,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-02-10 19:48:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 797. [2020-02-10 19:48:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:48:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 19:48:04,112 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 19:48:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:04,112 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 19:48:04,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 19:48:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:04,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:04,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:04,113 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:04,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1390260113, now seen corresponding path program 441 times [2020-02-10 19:48:04,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:04,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830064318] [2020-02-10 19:48:04,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:04,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830064318] [2020-02-10 19:48:04,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:04,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:04,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905340543] [2020-02-10 19:48:04,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:04,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:04,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:04,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:04,491 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 19:48:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:04,660 INFO L93 Difference]: Finished difference Result 1478 states and 5128 transitions. [2020-02-10 19:48:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:04,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:04,664 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:48:04,664 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 19:48:04,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 19:48:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 802. [2020-02-10 19:48:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:48:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3170 transitions. [2020-02-10 19:48:04,690 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3170 transitions. Word has length 25 [2020-02-10 19:48:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:04,690 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3170 transitions. [2020-02-10 19:48:04,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3170 transitions. [2020-02-10 19:48:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:04,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:04,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:04,692 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1892443153, now seen corresponding path program 442 times [2020-02-10 19:48:04,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:04,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233867526] [2020-02-10 19:48:04,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:05,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233867526] [2020-02-10 19:48:05,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:05,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:05,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120269113] [2020-02-10 19:48:05,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:05,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:05,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:05,085 INFO L87 Difference]: Start difference. First operand 802 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:48:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:05,195 INFO L93 Difference]: Finished difference Result 1483 states and 5133 transitions. [2020-02-10 19:48:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:05,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:05,199 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 19:48:05,199 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 19:48:05,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 19:48:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 797. [2020-02-10 19:48:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:48:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-02-10 19:48:05,222 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-02-10 19:48:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:05,223 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-02-10 19:48:05,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-02-10 19:48:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:05,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:05,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] [2020-02-10 19:48:05,224 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash -155136363, now seen corresponding path program 443 times [2020-02-10 19:48:05,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:05,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932541068] [2020-02-10 19:48:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:05,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932541068] [2020-02-10 19:48:05,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:05,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:05,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243575272] [2020-02-10 19:48:05,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:05,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:05,618 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:48:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:05,759 INFO L93 Difference]: Finished difference Result 1488 states and 5145 transitions. [2020-02-10 19:48:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:05,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:05,763 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 19:48:05,763 INFO L226 Difference]: Without dead ends: 1472 [2020-02-10 19:48:05,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2020-02-10 19:48:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 806. [2020-02-10 19:48:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 19:48:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3172 transitions. [2020-02-10 19:48:05,786 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3172 transitions. Word has length 25 [2020-02-10 19:48:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:05,786 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3172 transitions. [2020-02-10 19:48:05,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3172 transitions. [2020-02-10 19:48:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:05,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:05,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:05,787 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1228221743, now seen corresponding path program 444 times [2020-02-10 19:48:05,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:05,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559208569] [2020-02-10 19:48:05,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:06,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 19:48:06,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559208569] [2020-02-10 19:48:06,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:06,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:06,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515704801] [2020-02-10 19:48:06,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:06,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:06,184 INFO L87 Difference]: Start difference. First operand 806 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:48:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:06,323 INFO L93 Difference]: Finished difference Result 1490 states and 5141 transitions. [2020-02-10 19:48:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:06,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:06,327 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 19:48:06,327 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 19:48:06,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 19:48:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 791. [2020-02-10 19:48:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-02-10 19:48:06,350 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-02-10 19:48:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:06,350 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-02-10 19:48:06,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-02-10 19:48:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:06,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:06,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:06,351 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:06,352 INFO L82 PathProgramCache]: Analyzing trace with hash -958259691, now seen corresponding path program 445 times [2020-02-10 19:48:06,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:06,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321019869] [2020-02-10 19:48:06,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:06,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321019869] [2020-02-10 19:48:06,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:06,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:06,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780807328] [2020-02-10 19:48:06,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:06,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:06,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:06,742 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:48:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:06,901 INFO L93 Difference]: Finished difference Result 1467 states and 5104 transitions. [2020-02-10 19:48:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:06,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:06,905 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:48:06,905 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 19:48:06,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 19:48:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 800. [2020-02-10 19:48:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:48:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3164 transitions. [2020-02-10 19:48:06,928 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3164 transitions. Word has length 25 [2020-02-10 19:48:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:06,928 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3164 transitions. [2020-02-10 19:48:06,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3164 transitions. [2020-02-10 19:48:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:06,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:06,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:06,929 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:06,930 INFO L82 PathProgramCache]: Analyzing trace with hash 43501235, now seen corresponding path program 446 times [2020-02-10 19:48:06,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:06,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018802779] [2020-02-10 19:48:06,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:07,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 19:48:07,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018802779] [2020-02-10 19:48:07,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:07,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:07,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656634728] [2020-02-10 19:48:07,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:07,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:07,319 INFO L87 Difference]: Start difference. First operand 800 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:48:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:07,465 INFO L93 Difference]: Finished difference Result 1468 states and 5102 transitions. [2020-02-10 19:48:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:07,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:07,469 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 19:48:07,469 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 19:48:07,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 19:48:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 796. [2020-02-10 19:48:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:48:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-02-10 19:48:07,492 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-02-10 19:48:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:07,492 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-02-10 19:48:07,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-02-10 19:48:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:07,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:07,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:07,493 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 967774387, now seen corresponding path program 447 times [2020-02-10 19:48:07,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:07,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762822299] [2020-02-10 19:48:07,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:07,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762822299] [2020-02-10 19:48:07,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:07,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:07,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620866360] [2020-02-10 19:48:07,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:07,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:07,890 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:48:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:08,036 INFO L93 Difference]: Finished difference Result 1472 states and 5109 transitions. [2020-02-10 19:48:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:08,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:08,040 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 19:48:08,040 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:48:08,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:48:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 801. [2020-02-10 19:48:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:48:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-02-10 19:48:08,062 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-02-10 19:48:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:08,062 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-02-10 19:48:08,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-02-10 19:48:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:08,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:08,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:08,064 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1980038417, now seen corresponding path program 448 times [2020-02-10 19:48:08,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:08,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9425961] [2020-02-10 19:48:08,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:08,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9425961] [2020-02-10 19:48:08,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:08,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:08,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518611312] [2020-02-10 19:48:08,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:08,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:08,453 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:48:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:08,598 INFO L93 Difference]: Finished difference Result 1477 states and 5114 transitions. [2020-02-10 19:48:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:08,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:08,602 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 19:48:08,602 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 19:48:08,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 19:48:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-02-10 19:48:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:48:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 19:48:08,624 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 19:48:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:08,624 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 19:48:08,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 19:48:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:08,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:08,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:08,625 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1358915093, now seen corresponding path program 449 times [2020-02-10 19:48:08,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:08,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648390975] [2020-02-10 19:48:08,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:09,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648390975] [2020-02-10 19:48:09,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:09,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:09,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957243278] [2020-02-10 19:48:09,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:09,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:09,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:09,014 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:48:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:09,166 INFO L93 Difference]: Finished difference Result 1475 states and 5111 transitions. [2020-02-10 19:48:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:09,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:09,170 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:48:09,170 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 19:48:09,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 19:48:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-02-10 19:48:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:48:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-02-10 19:48:09,193 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-02-10 19:48:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:09,193 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-02-10 19:48:09,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-02-10 19:48:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:09,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:09,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:09,194 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1325111245, now seen corresponding path program 450 times [2020-02-10 19:48:09,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:09,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754014610] [2020-02-10 19:48:09,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:09,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 19:48:09,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754014610] [2020-02-10 19:48:09,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:09,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:09,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352609047] [2020-02-10 19:48:09,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:09,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:09,582 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-02-10 19:48:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:09,728 INFO L93 Difference]: Finished difference Result 1479 states and 5113 transitions. [2020-02-10 19:48:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:09,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:09,732 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 19:48:09,732 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 19:48:09,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 19:48:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 791. [2020-02-10 19:48:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-02-10 19:48:09,754 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-02-10 19:48:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:09,755 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-02-10 19:48:09,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-02-10 19:48:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:09,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:09,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:09,756 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2064877073, now seen corresponding path program 451 times [2020-02-10 19:48:09,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:09,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690158975] [2020-02-10 19:48:09,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:10,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 19:48:10,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690158975] [2020-02-10 19:48:10,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:10,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:10,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92221798] [2020-02-10 19:48:10,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:10,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:10,137 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:48:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,290 INFO L93 Difference]: Finished difference Result 1484 states and 5139 transitions. [2020-02-10 19:48:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:10,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:10,294 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 19:48:10,294 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 19:48:10,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 19:48:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 803. [2020-02-10 19:48:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:48:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-02-10 19:48:10,317 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-02-10 19:48:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:10,317 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-02-10 19:48:10,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-02-10 19:48:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:10,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:10,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:10,318 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:10,319 INFO L82 PathProgramCache]: Analyzing trace with hash -619149265, now seen corresponding path program 452 times [2020-02-10 19:48:10,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:10,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176614107] [2020-02-10 19:48:10,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:10,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176614107] [2020-02-10 19:48:10,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:10,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:10,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122775525] [2020-02-10 19:48:10,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:10,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:10,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:10,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:10,704 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:48:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,861 INFO L93 Difference]: Finished difference Result 1482 states and 5130 transitions. [2020-02-10 19:48:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:10,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:10,865 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 19:48:10,865 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 19:48:10,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 19:48:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 798. [2020-02-10 19:48:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:48:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3153 transitions. [2020-02-10 19:48:10,887 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3153 transitions. Word has length 25 [2020-02-10 19:48:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:10,887 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3153 transitions. [2020-02-10 19:48:10,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3153 transitions. [2020-02-10 19:48:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:10,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:10,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:10,888 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 464439219, now seen corresponding path program 453 times [2020-02-10 19:48:10,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:10,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287989038] [2020-02-10 19:48:10,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:11,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287989038] [2020-02-10 19:48:11,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:11,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:11,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215678094] [2020-02-10 19:48:11,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:11,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:11,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:11,283 INFO L87 Difference]: Start difference. First operand 798 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:48:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:11,448 INFO L93 Difference]: Finished difference Result 1492 states and 5150 transitions. [2020-02-10 19:48:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:11,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:11,452 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 19:48:11,452 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 19:48:11,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 19:48:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 807. [2020-02-10 19:48:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:48:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3169 transitions. [2020-02-10 19:48:11,475 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3169 transitions. Word has length 25 [2020-02-10 19:48:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:11,475 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3169 transitions. [2020-02-10 19:48:11,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3169 transitions. [2020-02-10 19:48:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:11,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:11,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] [2020-02-10 19:48:11,476 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash -608646161, now seen corresponding path program 454 times [2020-02-10 19:48:11,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:11,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62376446] [2020-02-10 19:48:11,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:11,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62376446] [2020-02-10 19:48:11,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:11,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:11,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106363190] [2020-02-10 19:48:11,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:11,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:11,871 INFO L87 Difference]: Start difference. First operand 807 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:48:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:12,008 INFO L93 Difference]: Finished difference Result 1494 states and 5146 transitions. [2020-02-10 19:48:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:12,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:12,011 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 19:48:12,012 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 19:48:12,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 19:48:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 798. [2020-02-10 19:48:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:48:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-02-10 19:48:12,034 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-02-10 19:48:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:12,034 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-02-10 19:48:12,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-02-10 19:48:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:12,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:12,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] [2020-02-10 19:48:12,035 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 474942323, now seen corresponding path program 455 times [2020-02-10 19:48:12,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:12,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308156146] [2020-02-10 19:48:12,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:12,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308156146] [2020-02-10 19:48:12,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:12,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:12,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923543608] [2020-02-10 19:48:12,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:12,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:12,422 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:48:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:12,585 INFO L93 Difference]: Finished difference Result 1485 states and 5128 transitions. [2020-02-10 19:48:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:12,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:12,589 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 19:48:12,589 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 19:48:12,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 19:48:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-02-10 19:48:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:48:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3157 transitions. [2020-02-10 19:48:12,611 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3157 transitions. Word has length 25 [2020-02-10 19:48:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:12,611 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3157 transitions. [2020-02-10 19:48:12,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3157 transitions. [2020-02-10 19:48:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:12,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:12,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:12,613 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2085883281, now seen corresponding path program 456 times [2020-02-10 19:48:12,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:12,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537005800] [2020-02-10 19:48:12,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:13,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537005800] [2020-02-10 19:48:13,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:13,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:13,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111625183] [2020-02-10 19:48:13,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:13,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:13,006 INFO L87 Difference]: Start difference. First operand 804 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:48:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:13,133 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-02-10 19:48:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:13,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:13,137 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 19:48:13,137 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 19:48:13,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 19:48:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 785. [2020-02-10 19:48:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:48:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-02-10 19:48:13,160 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-02-10 19:48:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:13,160 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-02-10 19:48:13,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-02-10 19:48:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:13,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:13,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:13,161 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash -128929703, now seen corresponding path program 457 times [2020-02-10 19:48:13,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:13,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604547475] [2020-02-10 19:48:13,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:13,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604547475] [2020-02-10 19:48:13,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:13,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:13,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49151413] [2020-02-10 19:48:13,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:13,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:13,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:13,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:13,577 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:48:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:13,733 INFO L93 Difference]: Finished difference Result 1491 states and 5177 transitions. [2020-02-10 19:48:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:13,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:13,737 INFO L225 Difference]: With dead ends: 1491 [2020-02-10 19:48:13,737 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 19:48:13,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 19:48:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 805. [2020-02-10 19:48:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 19:48:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3181 transitions. [2020-02-10 19:48:13,760 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3181 transitions. Word has length 25 [2020-02-10 19:48:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:13,760 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3181 transitions. [2020-02-10 19:48:13,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3181 transitions. [2020-02-10 19:48:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:13,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:13,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:13,762 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1202015083, now seen corresponding path program 458 times [2020-02-10 19:48:13,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:13,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777763906] [2020-02-10 19:48:13,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:14,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 19:48:14,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777763906] [2020-02-10 19:48:14,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:14,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:14,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007722328] [2020-02-10 19:48:14,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:14,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:14,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:14,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:14,156 INFO L87 Difference]: Start difference. First operand 805 states and 3181 transitions. Second operand 10 states. [2020-02-10 19:48:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:14,289 INFO L93 Difference]: Finished difference Result 1492 states and 5173 transitions. [2020-02-10 19:48:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:14,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:14,292 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 19:48:14,292 INFO L226 Difference]: Without dead ends: 1470 [2020-02-10 19:48:14,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-02-10 19:48:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 799. [2020-02-10 19:48:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:48:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3165 transitions. [2020-02-10 19:48:14,315 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3165 transitions. Word has length 25 [2020-02-10 19:48:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:14,315 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3165 transitions. [2020-02-10 19:48:14,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3165 transitions. [2020-02-10 19:48:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:14,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:14,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:14,316 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367557, now seen corresponding path program 459 times [2020-02-10 19:48:14,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:14,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501894385] [2020-02-10 19:48:14,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:14,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 19:48:14,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501894385] [2020-02-10 19:48:14,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:14,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:14,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144615235] [2020-02-10 19:48:14,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:14,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:14,705 INFO L87 Difference]: Start difference. First operand 799 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:48:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:14,856 INFO L93 Difference]: Finished difference Result 1488 states and 5165 transitions. [2020-02-10 19:48:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:14,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:14,860 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 19:48:14,860 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 19:48:14,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 19:48:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 804. [2020-02-10 19:48:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:48:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-02-10 19:48:14,899 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-02-10 19:48:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:14,899 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-02-10 19:48:14,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-02-10 19:48:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:14,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:14,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:14,900 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1191511979, now seen corresponding path program 460 times [2020-02-10 19:48:14,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:14,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257124205] [2020-02-10 19:48:14,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:15,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257124205] [2020-02-10 19:48:15,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:15,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:15,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168987026] [2020-02-10 19:48:15,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:15,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:15,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:15,311 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-02-10 19:48:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:15,442 INFO L93 Difference]: Finished difference Result 1487 states and 5158 transitions. [2020-02-10 19:48:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:15,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:15,446 INFO L225 Difference]: With dead ends: 1487 [2020-02-10 19:48:15,446 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 19:48:15,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 19:48:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 799. [2020-02-10 19:48:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:48:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3160 transitions. [2020-02-10 19:48:15,468 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3160 transitions. Word has length 25 [2020-02-10 19:48:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:15,468 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3160 transitions. [2020-02-10 19:48:15,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3160 transitions. [2020-02-10 19:48:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:15,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:15,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:15,470 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1708361349, now seen corresponding path program 461 times [2020-02-10 19:48:15,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:15,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351924732] [2020-02-10 19:48:15,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:15,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 19:48:15,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351924732] [2020-02-10 19:48:15,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:15,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:15,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998365425] [2020-02-10 19:48:15,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:15,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:15,849 INFO L87 Difference]: Start difference. First operand 799 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:48:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,001 INFO L93 Difference]: Finished difference Result 1490 states and 5164 transitions. [2020-02-10 19:48:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:16,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,004 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 19:48:16,004 INFO L226 Difference]: Without dead ends: 1474 [2020-02-10 19:48:16,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-02-10 19:48:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 804. [2020-02-10 19:48:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:48:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3169 transitions. [2020-02-10 19:48:16,027 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3169 transitions. Word has length 25 [2020-02-10 19:48:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:16,027 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3169 transitions. [2020-02-10 19:48:16,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3169 transitions. [2020-02-10 19:48:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:16,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:16,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:16,028 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash -97420391, now seen corresponding path program 462 times [2020-02-10 19:48:16,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:16,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615466343] [2020-02-10 19:48:16,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:16,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615466343] [2020-02-10 19:48:16,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:16,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:16,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303183479] [2020-02-10 19:48:16,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:16,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:16,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:16,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:16,410 INFO L87 Difference]: Start difference. First operand 804 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:48:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,548 INFO L93 Difference]: Finished difference Result 1488 states and 5155 transitions. [2020-02-10 19:48:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:16,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,552 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 19:48:16,552 INFO L226 Difference]: Without dead ends: 1464 [2020-02-10 19:48:16,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-02-10 19:48:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 794. [2020-02-10 19:48:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:48:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 19:48:16,575 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 19:48:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:16,575 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 19:48:16,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 19:48:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:16,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:16,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:16,576 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1797104375, now seen corresponding path program 463 times [2020-02-10 19:48:16,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:16,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046750491] [2020-02-10 19:48:16,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:16,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046750491] [2020-02-10 19:48:16,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:16,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:16,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613525979] [2020-02-10 19:48:16,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:16,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:16,973 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:48:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:17,110 INFO L93 Difference]: Finished difference Result 1505 states and 5203 transitions. [2020-02-10 19:48:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:17,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:17,114 INFO L225 Difference]: With dead ends: 1505 [2020-02-10 19:48:17,114 INFO L226 Difference]: Without dead ends: 1490 [2020-02-10 19:48:17,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-02-10 19:48:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 809. [2020-02-10 19:48:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-02-10 19:48:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 3186 transitions. [2020-02-10 19:48:17,139 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 3186 transitions. Word has length 25 [2020-02-10 19:48:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:17,139 INFO L479 AbstractCegarLoop]: Abstraction has 809 states and 3186 transitions. [2020-02-10 19:48:17,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 3186 transitions. [2020-02-10 19:48:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:17,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:17,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:17,140 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:17,140 INFO L82 PathProgramCache]: Analyzing trace with hash 724018995, now seen corresponding path program 464 times [2020-02-10 19:48:17,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:17,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646256482] [2020-02-10 19:48:17,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:17,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646256482] [2020-02-10 19:48:17,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:17,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:17,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881005462] [2020-02-10 19:48:17,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:17,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:17,535 INFO L87 Difference]: Start difference. First operand 809 states and 3186 transitions. Second operand 10 states. [2020-02-10 19:48:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:17,682 INFO L93 Difference]: Finished difference Result 1506 states and 5199 transitions. [2020-02-10 19:48:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:17,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:17,686 INFO L225 Difference]: With dead ends: 1506 [2020-02-10 19:48:17,686 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 19:48:17,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 19:48:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 803. [2020-02-10 19:48:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:48:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3169 transitions. [2020-02-10 19:48:17,708 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3169 transitions. Word has length 25 [2020-02-10 19:48:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:17,709 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3169 transitions. [2020-02-10 19:48:17,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3169 transitions. [2020-02-10 19:48:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:17,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:17,710 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:17,710 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1403771333, now seen corresponding path program 465 times [2020-02-10 19:48:17,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:17,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758136453] [2020-02-10 19:48:17,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:18,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758136453] [2020-02-10 19:48:18,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:18,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:18,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40631280] [2020-02-10 19:48:18,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:18,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:18,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:18,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:18,116 INFO L87 Difference]: Start difference. First operand 803 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:48:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:18,245 INFO L93 Difference]: Finished difference Result 1508 states and 5202 transitions. [2020-02-10 19:48:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:18,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:18,249 INFO L225 Difference]: With dead ends: 1508 [2020-02-10 19:48:18,249 INFO L226 Difference]: Without dead ends: 1493 [2020-02-10 19:48:18,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2020-02-10 19:48:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 810. [2020-02-10 19:48:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 19:48:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3182 transitions. [2020-02-10 19:48:18,271 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3182 transitions. Word has length 25 [2020-02-10 19:48:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:18,271 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3182 transitions. [2020-02-10 19:48:18,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3182 transitions. [2020-02-10 19:48:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:18,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:18,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:18,287 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash 745025203, now seen corresponding path program 466 times [2020-02-10 19:48:18,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:18,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801590285] [2020-02-10 19:48:18,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:18,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801590285] [2020-02-10 19:48:18,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:18,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:18,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807598242] [2020-02-10 19:48:18,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:18,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:18,693 INFO L87 Difference]: Start difference. First operand 810 states and 3182 transitions. Second operand 10 states. [2020-02-10 19:48:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:18,817 INFO L93 Difference]: Finished difference Result 1511 states and 5201 transitions. [2020-02-10 19:48:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:18,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:18,821 INFO L225 Difference]: With dead ends: 1511 [2020-02-10 19:48:18,821 INFO L226 Difference]: Without dead ends: 1486 [2020-02-10 19:48:18,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-02-10 19:48:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 803. [2020-02-10 19:48:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:48:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3162 transitions. [2020-02-10 19:48:18,844 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3162 transitions. Word has length 25 [2020-02-10 19:48:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:18,844 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3162 transitions. [2020-02-10 19:48:18,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3162 transitions. [2020-02-10 19:48:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:18,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:18,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:18,846 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:18,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1382765125, now seen corresponding path program 467 times [2020-02-10 19:48:18,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:18,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249101788] [2020-02-10 19:48:18,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:19,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249101788] [2020-02-10 19:48:19,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:19,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419506752] [2020-02-10 19:48:19,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:19,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:19,247 INFO L87 Difference]: Start difference. First operand 803 states and 3162 transitions. Second operand 10 states. [2020-02-10 19:48:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:19,381 INFO L93 Difference]: Finished difference Result 1512 states and 5203 transitions. [2020-02-10 19:48:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:19,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:19,384 INFO L225 Difference]: With dead ends: 1512 [2020-02-10 19:48:19,384 INFO L226 Difference]: Without dead ends: 1496 [2020-02-10 19:48:19,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-02-10 19:48:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 812. [2020-02-10 19:48:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-02-10 19:48:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 3178 transitions. [2020-02-10 19:48:19,407 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 3178 transitions. Word has length 25 [2020-02-10 19:48:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:19,407 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 3178 transitions. [2020-02-10 19:48:19,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 3178 transitions. [2020-02-10 19:48:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:19,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:19,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:19,409 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1839116791, now seen corresponding path program 468 times [2020-02-10 19:48:19,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:19,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795568706] [2020-02-10 19:48:19,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:19,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795568706] [2020-02-10 19:48:19,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:19,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693350072] [2020-02-10 19:48:19,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:19,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:19,820 INFO L87 Difference]: Start difference. First operand 812 states and 3178 transitions. Second operand 10 states. [2020-02-10 19:48:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:19,953 INFO L93 Difference]: Finished difference Result 1514 states and 5199 transitions. [2020-02-10 19:48:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:19,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:19,957 INFO L225 Difference]: With dead ends: 1514 [2020-02-10 19:48:19,957 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 19:48:19,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 19:48:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 794. [2020-02-10 19:48:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:48:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-02-10 19:48:19,980 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-02-10 19:48:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:19,980 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-02-10 19:48:19,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-02-10 19:48:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:19,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:19,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:19,981 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700599, now seen corresponding path program 469 times [2020-02-10 19:48:19,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:19,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929342551] [2020-02-10 19:48:19,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:20,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929342551] [2020-02-10 19:48:20,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:20,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:20,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788401387] [2020-02-10 19:48:20,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:20,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:20,378 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:48:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:20,540 INFO L93 Difference]: Finished difference Result 1493 states and 5167 transitions. [2020-02-10 19:48:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:20,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:20,544 INFO L225 Difference]: With dead ends: 1493 [2020-02-10 19:48:20,544 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 19:48:20,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 19:48:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 805. [2020-02-10 19:48:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 19:48:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3169 transitions. [2020-02-10 19:48:20,568 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3169 transitions. Word has length 25 [2020-02-10 19:48:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:20,568 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3169 transitions. [2020-02-10 19:48:20,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3169 transitions. [2020-02-10 19:48:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:20,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:20,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:20,570 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1634411119, now seen corresponding path program 470 times [2020-02-10 19:48:20,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:20,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464361216] [2020-02-10 19:48:20,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:20,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464361216] [2020-02-10 19:48:20,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:20,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:20,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794541699] [2020-02-10 19:48:20,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:20,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:20,977 INFO L87 Difference]: Start difference. First operand 805 states and 3169 transitions. Second operand 10 states. [2020-02-10 19:48:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:21,110 INFO L93 Difference]: Finished difference Result 1492 states and 5160 transitions. [2020-02-10 19:48:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:21,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:21,114 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 19:48:21,114 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 19:48:21,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 19:48:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 800. [2020-02-10 19:48:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:48:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3155 transitions. [2020-02-10 19:48:21,137 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3155 transitions. Word has length 25 [2020-02-10 19:48:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:21,137 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3155 transitions. [2020-02-10 19:48:21,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3155 transitions. [2020-02-10 19:48:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:21,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:21,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] [2020-02-10 19:48:21,138 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash 522262745, now seen corresponding path program 471 times [2020-02-10 19:48:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:21,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811412114] [2020-02-10 19:48:21,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:21,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811412114] [2020-02-10 19:48:21,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:21,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:21,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884196243] [2020-02-10 19:48:21,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:21,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:21,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:21,524 INFO L87 Difference]: Start difference. First operand 800 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:48:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:21,666 INFO L93 Difference]: Finished difference Result 1499 states and 5174 transitions. [2020-02-10 19:48:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:21,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:21,670 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 19:48:21,670 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 19:48:21,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 19:48:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 807. [2020-02-10 19:48:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:48:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3168 transitions. [2020-02-10 19:48:21,693 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3168 transitions. Word has length 25 [2020-02-10 19:48:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:21,693 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3168 transitions. [2020-02-10 19:48:21,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3168 transitions. [2020-02-10 19:48:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:21,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:21,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:21,694 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:21,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1623908015, now seen corresponding path program 472 times [2020-02-10 19:48:21,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:21,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359460953] [2020-02-10 19:48:21,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:22,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359460953] [2020-02-10 19:48:22,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:22,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:22,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886763470] [2020-02-10 19:48:22,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:22,103 INFO L87 Difference]: Start difference. First operand 807 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:48:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:22,251 INFO L93 Difference]: Finished difference Result 1502 states and 5173 transitions. [2020-02-10 19:48:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:22,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:22,255 INFO L225 Difference]: With dead ends: 1502 [2020-02-10 19:48:22,255 INFO L226 Difference]: Without dead ends: 1477 [2020-02-10 19:48:22,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-02-10 19:48:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 800. [2020-02-10 19:48:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:48:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3149 transitions. [2020-02-10 19:48:22,278 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3149 transitions. Word has length 25 [2020-02-10 19:48:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:22,278 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3149 transitions. [2020-02-10 19:48:22,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3149 transitions. [2020-02-10 19:48:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:22,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:22,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] [2020-02-10 19:48:22,280 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 553772057, now seen corresponding path program 473 times [2020-02-10 19:48:22,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:22,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873587901] [2020-02-10 19:48:22,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:22,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873587901] [2020-02-10 19:48:22,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:22,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:22,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393162501] [2020-02-10 19:48:22,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:22,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:22,662 INFO L87 Difference]: Start difference. First operand 800 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:48:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:22,801 INFO L93 Difference]: Finished difference Result 1496 states and 5161 transitions. [2020-02-10 19:48:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:22,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:22,805 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 19:48:22,805 INFO L226 Difference]: Without dead ends: 1482 [2020-02-10 19:48:22,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-02-10 19:48:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 806. [2020-02-10 19:48:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 19:48:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3160 transitions. [2020-02-10 19:48:22,827 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3160 transitions. Word has length 25 [2020-02-10 19:48:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:22,827 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3160 transitions. [2020-02-10 19:48:22,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3160 transitions. [2020-02-10 19:48:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:22,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:22,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:22,828 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2130254281, now seen corresponding path program 474 times [2020-02-10 19:48:22,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:22,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472108400] [2020-02-10 19:48:22,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:23,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472108400] [2020-02-10 19:48:23,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:23,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581222088] [2020-02-10 19:48:23,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:23,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:23,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:23,224 INFO L87 Difference]: Start difference. First operand 806 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:48:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:23,339 INFO L93 Difference]: Finished difference Result 1500 states and 5163 transitions. [2020-02-10 19:48:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:23,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:23,343 INFO L225 Difference]: With dead ends: 1500 [2020-02-10 19:48:23,343 INFO L226 Difference]: Without dead ends: 1470 [2020-02-10 19:48:23,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-02-10 19:48:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 794. [2020-02-10 19:48:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:48:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3132 transitions. [2020-02-10 19:48:23,366 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3132 transitions. Word has length 25 [2020-02-10 19:48:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:23,366 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3132 transitions. [2020-02-10 19:48:23,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3132 transitions. [2020-02-10 19:48:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:23,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:23,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:23,367 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1700807667, now seen corresponding path program 475 times [2020-02-10 19:48:23,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:23,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348562815] [2020-02-10 19:48:23,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:23,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348562815] [2020-02-10 19:48:23,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:23,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021919346] [2020-02-10 19:48:23,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:23,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:23,757 INFO L87 Difference]: Start difference. First operand 794 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:48:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:23,915 INFO L93 Difference]: Finished difference Result 1499 states and 5173 transitions. [2020-02-10 19:48:23,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:23,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:23,919 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 19:48:23,920 INFO L226 Difference]: Without dead ends: 1483 [2020-02-10 19:48:23,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2020-02-10 19:48:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 806. [2020-02-10 19:48:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 19:48:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3165 transitions. [2020-02-10 19:48:23,943 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3165 transitions. Word has length 25 [2020-02-10 19:48:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:23,944 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3165 transitions. [2020-02-10 19:48:23,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3165 transitions. [2020-02-10 19:48:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:23,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:23,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:23,945 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash -983218671, now seen corresponding path program 476 times [2020-02-10 19:48:23,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:23,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078905200] [2020-02-10 19:48:23,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:24,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078905200] [2020-02-10 19:48:24,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:24,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:24,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931818147] [2020-02-10 19:48:24,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:24,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:24,330 INFO L87 Difference]: Start difference. First operand 806 states and 3165 transitions. Second operand 10 states. [2020-02-10 19:48:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:24,506 INFO L93 Difference]: Finished difference Result 1497 states and 5164 transitions. [2020-02-10 19:48:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:24,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:24,510 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 19:48:24,510 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 19:48:24,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 19:48:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 801. [2020-02-10 19:48:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:48:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-02-10 19:48:24,544 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-02-10 19:48:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:24,544 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-02-10 19:48:24,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-02-10 19:48:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:24,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:24,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:24,546 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash 100369813, now seen corresponding path program 477 times [2020-02-10 19:48:24,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:24,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311283256] [2020-02-10 19:48:24,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:24,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 19:48:24,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311283256] [2020-02-10 19:48:24,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:24,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:24,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061553235] [2020-02-10 19:48:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:24,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:24,982 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:48:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:25,163 INFO L93 Difference]: Finished difference Result 1507 states and 5184 transitions. [2020-02-10 19:48:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:25,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:25,167 INFO L225 Difference]: With dead ends: 1507 [2020-02-10 19:48:25,167 INFO L226 Difference]: Without dead ends: 1491 [2020-02-10 19:48:25,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2020-02-10 19:48:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 810. [2020-02-10 19:48:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 19:48:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-02-10 19:48:25,189 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-02-10 19:48:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:25,189 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-02-10 19:48:25,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-02-10 19:48:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:25,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:25,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:25,191 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash -972715567, now seen corresponding path program 478 times [2020-02-10 19:48:25,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:25,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040676147] [2020-02-10 19:48:25,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040676147] [2020-02-10 19:48:25,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:25,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:25,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356981511] [2020-02-10 19:48:25,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:25,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:25,597 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:48:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:25,754 INFO L93 Difference]: Finished difference Result 1509 states and 5180 transitions. [2020-02-10 19:48:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:25,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:25,758 INFO L225 Difference]: With dead ends: 1509 [2020-02-10 19:48:25,758 INFO L226 Difference]: Without dead ends: 1482 [2020-02-10 19:48:25,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-02-10 19:48:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 801. [2020-02-10 19:48:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:48:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3144 transitions. [2020-02-10 19:48:25,781 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3144 transitions. Word has length 25 [2020-02-10 19:48:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:25,781 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3144 transitions. [2020-02-10 19:48:25,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3144 transitions. [2020-02-10 19:48:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:25,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:25,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] [2020-02-10 19:48:25,782 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 110872917, now seen corresponding path program 479 times [2020-02-10 19:48:25,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:25,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431873329] [2020-02-10 19:48:25,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431873329] [2020-02-10 19:48:26,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:26,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:26,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562120488] [2020-02-10 19:48:26,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:26,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:26,176 INFO L87 Difference]: Start difference. First operand 801 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:48:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:26,359 INFO L93 Difference]: Finished difference Result 1500 states and 5162 transitions. [2020-02-10 19:48:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:26,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:26,362 INFO L225 Difference]: With dead ends: 1500 [2020-02-10 19:48:26,362 INFO L226 Difference]: Without dead ends: 1486 [2020-02-10 19:48:26,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-02-10 19:48:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 807. [2020-02-10 19:48:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:48:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3155 transitions. [2020-02-10 19:48:26,385 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3155 transitions. Word has length 25 [2020-02-10 19:48:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:26,385 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3155 transitions. [2020-02-10 19:48:26,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3155 transitions. [2020-02-10 19:48:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:26,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:26,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:26,387 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1721813875, now seen corresponding path program 480 times [2020-02-10 19:48:26,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684437127] [2020-02-10 19:48:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:26,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684437127] [2020-02-10 19:48:26,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:26,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:26,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930621620] [2020-02-10 19:48:26,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:26,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:26,792 INFO L87 Difference]: Start difference. First operand 807 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:48:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:26,916 INFO L93 Difference]: Finished difference Result 1504 states and 5164 transitions. [2020-02-10 19:48:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:26,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:26,919 INFO L225 Difference]: With dead ends: 1504 [2020-02-10 19:48:26,919 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 19:48:26,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 19:48:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 776. [2020-02-10 19:48:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:48:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 19:48:26,941 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 19:48:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:26,941 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 19:48:26,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 19:48:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:26,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:26,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:26,942 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash -470807655, now seen corresponding path program 481 times [2020-02-10 19:48:26,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:26,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101027823] [2020-02-10 19:48:26,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:27,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101027823] [2020-02-10 19:48:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:27,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:27,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215380783] [2020-02-10 19:48:27,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:27,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:27,317 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:48:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:27,494 INFO L93 Difference]: Finished difference Result 1389 states and 4892 transitions. [2020-02-10 19:48:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:27,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:27,498 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:48:27,498 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:48:27,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:48:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-02-10 19:48:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3149 transitions. [2020-02-10 19:48:27,520 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3149 transitions. Word has length 25 [2020-02-10 19:48:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:27,521 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3149 transitions. [2020-02-10 19:48:27,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3149 transitions. [2020-02-10 19:48:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:27,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:27,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:27,522 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:27,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:27,522 INFO L82 PathProgramCache]: Analyzing trace with hash 509947063, now seen corresponding path program 482 times [2020-02-10 19:48:27,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:27,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870378381] [2020-02-10 19:48:27,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:27,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870378381] [2020-02-10 19:48:27,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:27,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:27,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066307022] [2020-02-10 19:48:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:27,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:27,897 INFO L87 Difference]: Start difference. First operand 790 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:48:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:28,056 INFO L93 Difference]: Finished difference Result 1388 states and 4887 transitions. [2020-02-10 19:48:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:28,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:28,060 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 19:48:28,060 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:48:28,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:48:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 19:48:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:48:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 19:48:28,082 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 19:48:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,082 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 19:48:28,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 19:48:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:28,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:28,084 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1455226423, now seen corresponding path program 483 times [2020-02-10 19:48:28,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878152683] [2020-02-10 19:48:28,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:28,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 19:48:28,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878152683] [2020-02-10 19:48:28,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:28,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:28,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417059784] [2020-02-10 19:48:28,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:28,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:28,448 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:48:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:28,591 INFO L93 Difference]: Finished difference Result 1394 states and 4900 transitions. [2020-02-10 19:48:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:28,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:28,595 INFO L225 Difference]: With dead ends: 1394 [2020-02-10 19:48:28,595 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 19:48:28,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 19:48:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 791. [2020-02-10 19:48:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3148 transitions. [2020-02-10 19:48:28,618 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3148 transitions. Word has length 25 [2020-02-10 19:48:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,618 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3148 transitions. [2020-02-10 19:48:28,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3148 transitions. [2020-02-10 19:48:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:28,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:28,620 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1848483051, now seen corresponding path program 484 times [2020-02-10 19:48:28,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617767718] [2020-02-10 19:48:28,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:28,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617767718] [2020-02-10 19:48:28,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:28,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:28,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851388293] [2020-02-10 19:48:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:28,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:28,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:28,988 INFO L87 Difference]: Start difference. First operand 791 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:48:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:29,170 INFO L93 Difference]: Finished difference Result 1397 states and 4902 transitions. [2020-02-10 19:48:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:29,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:29,173 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 19:48:29,174 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 19:48:29,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 19:48:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 787. [2020-02-10 19:48:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:48:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 19:48:29,196 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 19:48:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:29,196 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 19:48:29,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 19:48:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:29,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:29,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:29,197 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:29,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1174168473, now seen corresponding path program 485 times [2020-02-10 19:48:29,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:29,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281049801] [2020-02-10 19:48:29,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:29,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281049801] [2020-02-10 19:48:29,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:29,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:29,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484955608] [2020-02-10 19:48:29,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:29,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:29,566 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:48:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:29,710 INFO L93 Difference]: Finished difference Result 1391 states and 4890 transitions. [2020-02-10 19:48:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:29,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:29,714 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 19:48:29,714 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 19:48:29,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 19:48:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-02-10 19:48:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-02-10 19:48:29,737 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-02-10 19:48:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:29,737 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-02-10 19:48:29,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-02-10 19:48:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:29,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:29,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] [2020-02-10 19:48:29,738 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1509857865, now seen corresponding path program 486 times [2020-02-10 19:48:29,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:29,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67443435] [2020-02-10 19:48:29,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:30,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67443435] [2020-02-10 19:48:30,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:30,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:30,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354603192] [2020-02-10 19:48:30,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:30,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:30,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:30,109 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:48:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:30,289 INFO L93 Difference]: Finished difference Result 1395 states and 4895 transitions. [2020-02-10 19:48:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:30,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:30,293 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:48:30,293 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:48:30,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:48:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 784. [2020-02-10 19:48:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:48:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-02-10 19:48:30,316 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-02-10 19:48:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:30,316 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-02-10 19:48:30,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-02-10 19:48:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:30,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:30,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:30,318 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:30,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:30,318 INFO L82 PathProgramCache]: Analyzing trace with hash -893293381, now seen corresponding path program 487 times [2020-02-10 19:48:30,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:30,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630610889] [2020-02-10 19:48:30,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:30,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 19:48:30,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630610889] [2020-02-10 19:48:30,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:30,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:30,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760025111] [2020-02-10 19:48:30,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:30,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:30,699 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:48:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:30,877 INFO L93 Difference]: Finished difference Result 1387 states and 4885 transitions. [2020-02-10 19:48:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:30,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:30,880 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:48:30,880 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:48:30,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:48:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-02-10 19:48:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-02-10 19:48:30,902 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-02-10 19:48:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:30,902 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-02-10 19:48:30,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-02-10 19:48:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:30,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:30,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:30,903 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash 87461337, now seen corresponding path program 488 times [2020-02-10 19:48:30,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:30,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79869207] [2020-02-10 19:48:30,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:31,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79869207] [2020-02-10 19:48:31,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:31,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:31,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759515511] [2020-02-10 19:48:31,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:31,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:31,299 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:48:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:31,476 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-02-10 19:48:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:31,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:31,480 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 19:48:31,480 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 19:48:31,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 19:48:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-02-10 19:48:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:48:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 19:48:31,503 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 19:48:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:31,503 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 19:48:31,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 19:48:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:31,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:31,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:31,504 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1336192521, now seen corresponding path program 489 times [2020-02-10 19:48:31,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:31,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622851265] [2020-02-10 19:48:31,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622851265] [2020-02-10 19:48:31,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:31,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625879011] [2020-02-10 19:48:31,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:31,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:31,883 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:48:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:32,057 INFO L93 Difference]: Finished difference Result 1390 states and 4889 transitions. [2020-02-10 19:48:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:32,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:32,061 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 19:48:32,061 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 19:48:32,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 19:48:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 791. [2020-02-10 19:48:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 19:48:32,083 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:32,083 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 19:48:32,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 19:48:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:32,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:32,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:32,084 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:32,085 INFO L82 PathProgramCache]: Analyzing trace with hash -334431595, now seen corresponding path program 490 times [2020-02-10 19:48:32,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:32,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958182856] [2020-02-10 19:48:32,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:32,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958182856] [2020-02-10 19:48:32,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:32,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:32,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847243797] [2020-02-10 19:48:32,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:32,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:32,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:32,463 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:32,618 INFO L93 Difference]: Finished difference Result 1391 states and 4887 transitions. [2020-02-10 19:48:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:32,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:32,621 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 19:48:32,621 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 19:48:32,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 19:48:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 19:48:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:48:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-02-10 19:48:32,643 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-02-10 19:48:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:32,643 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-02-10 19:48:32,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-02-10 19:48:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:32,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:32,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:32,644 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1077278971, now seen corresponding path program 491 times [2020-02-10 19:48:32,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:32,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144108424] [2020-02-10 19:48:32,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:33,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144108424] [2020-02-10 19:48:33,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:33,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:33,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444293122] [2020-02-10 19:48:33,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:33,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:33,014 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:48:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:33,151 INFO L93 Difference]: Finished difference Result 1387 states and 4879 transitions. [2020-02-10 19:48:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:33,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:33,155 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 19:48:33,155 INFO L226 Difference]: Without dead ends: 1375 [2020-02-10 19:48:33,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-02-10 19:48:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 790. [2020-02-10 19:48:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 19:48:33,177 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 19:48:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:33,177 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 19:48:33,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 19:48:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:33,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:33,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:33,178 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash 4193591, now seen corresponding path program 492 times [2020-02-10 19:48:33,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:33,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084828255] [2020-02-10 19:48:33,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:33,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084828255] [2020-02-10 19:48:33,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:33,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:33,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034194305] [2020-02-10 19:48:33,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:33,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:33,553 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:48:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:33,714 INFO L93 Difference]: Finished difference Result 1389 states and 4880 transitions. [2020-02-10 19:48:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:33,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:33,718 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 19:48:33,718 INFO L226 Difference]: Without dead ends: 1369 [2020-02-10 19:48:33,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-02-10 19:48:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 784. [2020-02-10 19:48:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:48:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 19:48:33,740 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 19:48:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:33,740 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 19:48:33,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 19:48:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:33,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:33,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:33,741 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash 610254971, now seen corresponding path program 493 times [2020-02-10 19:48:33,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:33,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529531350] [2020-02-10 19:48:33,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:34,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529531350] [2020-02-10 19:48:34,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:34,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291318908] [2020-02-10 19:48:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:34,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:34,110 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:48:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:34,285 INFO L93 Difference]: Finished difference Result 1400 states and 4914 transitions. [2020-02-10 19:48:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:34,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:34,289 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 19:48:34,289 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 19:48:34,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 19:48:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 792. [2020-02-10 19:48:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 19:48:34,312 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 19:48:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:34,312 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 19:48:34,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 19:48:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:34,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:34,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:34,313 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1601512793, now seen corresponding path program 494 times [2020-02-10 19:48:34,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:34,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129956677] [2020-02-10 19:48:34,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:34,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129956677] [2020-02-10 19:48:34,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:34,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795747856] [2020-02-10 19:48:34,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:34,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:34,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:34,695 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:48:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:34,833 INFO L93 Difference]: Finished difference Result 1403 states and 4916 transitions. [2020-02-10 19:48:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:34,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:34,837 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:48:34,837 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:48:34,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:48:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 19:48:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:48:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 19:48:34,859 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 19:48:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:34,859 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 19:48:34,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 19:48:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:34,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:34,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] [2020-02-10 19:48:34,861 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1758678247, now seen corresponding path program 495 times [2020-02-10 19:48:34,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:34,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883997695] [2020-02-10 19:48:34,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:35,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 19:48:35,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883997695] [2020-02-10 19:48:35,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:35,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:35,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408009737] [2020-02-10 19:48:35,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:35,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:35,238 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:48:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,380 INFO L93 Difference]: Finished difference Result 1398 states and 4906 transitions. [2020-02-10 19:48:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:35,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,384 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 19:48:35,384 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:48:35,384 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:48:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-02-10 19:48:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 19:48:35,406 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,406 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 19:48:35,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 19:48:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:35,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:35,408 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash -756917321, now seen corresponding path program 496 times [2020-02-10 19:48:35,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301412478] [2020-02-10 19:48:35,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:35,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301412478] [2020-02-10 19:48:35,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:35,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:35,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290715273] [2020-02-10 19:48:35,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:35,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:35,773 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,918 INFO L93 Difference]: Finished difference Result 1399 states and 4904 transitions. [2020-02-10 19:48:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:35,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,922 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:48:35,922 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 19:48:35,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 19:48:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 788. [2020-02-10 19:48:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:48:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 19:48:35,945 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 19:48:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,945 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 19:48:35,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 19:48:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:35,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:35,946 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1703636869, now seen corresponding path program 497 times [2020-02-10 19:48:35,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756896754] [2020-02-10 19:48:35,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:36,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756896754] [2020-02-10 19:48:36,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:36,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:36,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538212354] [2020-02-10 19:48:36,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:36,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:36,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:36,303 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:48:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:36,423 INFO L93 Difference]: Finished difference Result 1405 states and 4917 transitions. [2020-02-10 19:48:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:36,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:36,427 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 19:48:36,427 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 19:48:36,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 19:48:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-02-10 19:48:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:48:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-02-10 19:48:36,449 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-02-10 19:48:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:36,449 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-02-10 19:48:36,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-02-10 19:48:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:36,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:36,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] [2020-02-10 19:48:36,450 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash -92695911, now seen corresponding path program 498 times [2020-02-10 19:48:36,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:36,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27407412] [2020-02-10 19:48:36,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:36,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27407412] [2020-02-10 19:48:36,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:36,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:36,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563698738] [2020-02-10 19:48:36,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:36,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:36,820 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:48:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:36,950 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-02-10 19:48:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:36,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:36,953 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:48:36,953 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:48:36,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:48:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-02-10 19:48:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:48:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3124 transitions. [2020-02-10 19:48:36,975 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3124 transitions. Word has length 25 [2020-02-10 19:48:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:36,975 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3124 transitions. [2020-02-10 19:48:36,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3124 transitions. [2020-02-10 19:48:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:36,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:36,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:36,976 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1793744055, now seen corresponding path program 499 times [2020-02-10 19:48:36,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:36,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550593304] [2020-02-10 19:48:36,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:37,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 19:48:37,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550593304] [2020-02-10 19:48:37,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:37,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:37,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854031025] [2020-02-10 19:48:37,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:37,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:37,331 INFO L87 Difference]: Start difference. First operand 784 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:48:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:37,472 INFO L93 Difference]: Finished difference Result 1393 states and 4892 transitions. [2020-02-10 19:48:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:37,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:37,476 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 19:48:37,476 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 19:48:37,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 19:48:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 790. [2020-02-10 19:48:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 19:48:37,498 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 19:48:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:37,498 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 19:48:37,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 19:48:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:37,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:37,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:37,499 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -890282283, now seen corresponding path program 500 times [2020-02-10 19:48:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:37,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626498692] [2020-02-10 19:48:37,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:37,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626498692] [2020-02-10 19:48:37,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:37,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:37,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944099827] [2020-02-10 19:48:37,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:37,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:37,871 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:48:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:37,993 INFO L93 Difference]: Finished difference Result 1397 states and 4897 transitions. [2020-02-10 19:48:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:37,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:37,997 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 19:48:37,997 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 19:48:37,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 19:48:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 787. [2020-02-10 19:48:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:48:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3132 transitions. [2020-02-10 19:48:38,020 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3132 transitions. Word has length 25 [2020-02-10 19:48:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:38,020 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3132 transitions. [2020-02-10 19:48:38,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3132 transitions. [2020-02-10 19:48:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:38,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:38,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:38,021 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash 193306201, now seen corresponding path program 501 times [2020-02-10 19:48:38,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:38,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997228416] [2020-02-10 19:48:38,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:38,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997228416] [2020-02-10 19:48:38,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:38,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:38,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997638350] [2020-02-10 19:48:38,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:38,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:38,392 INFO L87 Difference]: Start difference. First operand 787 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:48:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:38,529 INFO L93 Difference]: Finished difference Result 1391 states and 4885 transitions. [2020-02-10 19:48:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:38,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:38,532 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 19:48:38,532 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 19:48:38,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 19:48:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-02-10 19:48:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-02-10 19:48:38,554 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-02-10 19:48:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:38,554 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-02-10 19:48:38,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-02-10 19:48:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:38,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:38,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:38,556 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -879779179, now seen corresponding path program 502 times [2020-02-10 19:48:38,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:38,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109698409] [2020-02-10 19:48:38,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:38,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109698409] [2020-02-10 19:48:38,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:38,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:38,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331459856] [2020-02-10 19:48:38,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:38,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:38,914 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:48:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:39,036 INFO L93 Difference]: Finished difference Result 1393 states and 4886 transitions. [2020-02-10 19:48:39,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:39,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:39,040 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 19:48:39,040 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 19:48:39,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 19:48:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-02-10 19:48:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:48:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-02-10 19:48:39,063 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-02-10 19:48:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:39,063 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-02-10 19:48:39,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-02-10 19:48:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:39,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:39,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:39,064 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 203809305, now seen corresponding path program 503 times [2020-02-10 19:48:39,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:39,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34407998] [2020-02-10 19:48:39,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:39,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34407998] [2020-02-10 19:48:39,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:39,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:39,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772072743] [2020-02-10 19:48:39,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:39,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:39,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:39,431 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:48:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:39,552 INFO L93 Difference]: Finished difference Result 1401 states and 4904 transitions. [2020-02-10 19:48:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:39,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:39,556 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 19:48:39,556 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 19:48:39,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 19:48:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-02-10 19:48:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3138 transitions. [2020-02-10 19:48:39,579 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3138 transitions. Word has length 25 [2020-02-10 19:48:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:39,579 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3138 transitions. [2020-02-10 19:48:39,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3138 transitions. [2020-02-10 19:48:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:39,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:39,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:39,580 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1814750263, now seen corresponding path program 504 times [2020-02-10 19:48:39,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:39,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528681750] [2020-02-10 19:48:39,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:39,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 19:48:39,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528681750] [2020-02-10 19:48:39,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:39,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:39,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306031222] [2020-02-10 19:48:39,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:39,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:39,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:39,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:39,949 INFO L87 Difference]: Start difference. First operand 792 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:48:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:40,074 INFO L93 Difference]: Finished difference Result 1399 states and 4895 transitions. [2020-02-10 19:48:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:40,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:40,078 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:48:40,078 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 19:48:40,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 19:48:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 781. [2020-02-10 19:48:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:48:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 19:48:40,102 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 19:48:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:40,102 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 19:48:40,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 19:48:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:40,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:40,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] [2020-02-10 19:48:40,103 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash -682963273, now seen corresponding path program 505 times [2020-02-10 19:48:40,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:40,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263222234] [2020-02-10 19:48:40,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:40,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263222234] [2020-02-10 19:48:40,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:40,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:40,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225895961] [2020-02-10 19:48:40,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:40,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:40,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:40,486 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:48:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:40,617 INFO L93 Difference]: Finished difference Result 1406 states and 4929 transitions. [2020-02-10 19:48:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:40,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:40,621 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 19:48:40,621 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:48:40,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:48:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-02-10 19:48:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-02-10 19:48:40,645 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-02-10 19:48:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:40,645 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-02-10 19:48:40,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-02-10 19:48:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:40,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:40,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:40,646 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 297791445, now seen corresponding path program 506 times [2020-02-10 19:48:40,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:40,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153678437] [2020-02-10 19:48:40,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:41,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153678437] [2020-02-10 19:48:41,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:41,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:41,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414621877] [2020-02-10 19:48:41,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:41,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:41,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:41,027 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:48:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:41,152 INFO L93 Difference]: Finished difference Result 1405 states and 4924 transitions. [2020-02-10 19:48:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:41,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:41,156 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 19:48:41,156 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:48:41,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:48:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 19:48:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:48:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-02-10 19:48:41,194 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:41,194 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-02-10 19:48:41,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-02-10 19:48:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:41,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:41,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:41,195 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1243070805, now seen corresponding path program 507 times [2020-02-10 19:48:41,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:41,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298933661] [2020-02-10 19:48:41,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:41,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 19:48:41,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298933661] [2020-02-10 19:48:41,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:41,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:41,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843823306] [2020-02-10 19:48:41,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:41,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:41,573 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:41,699 INFO L93 Difference]: Finished difference Result 1411 states and 4937 transitions. [2020-02-10 19:48:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:41,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:41,703 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:48:41,703 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:48:41,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:48:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 19:48:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:48:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 19:48:41,725 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 19:48:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:41,726 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 19:48:41,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 19:48:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:41,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:41,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:41,727 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2060638669, now seen corresponding path program 508 times [2020-02-10 19:48:41,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:41,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399446851] [2020-02-10 19:48:41,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:42,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 19:48:42,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399446851] [2020-02-10 19:48:42,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:42,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:42,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284264206] [2020-02-10 19:48:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:42,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:42,100 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:48:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:42,230 INFO L93 Difference]: Finished difference Result 1414 states and 4939 transitions. [2020-02-10 19:48:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:42,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:42,233 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:48:42,233 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:48:42,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:42,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:48:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 19:48:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:48:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-02-10 19:48:42,255 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-02-10 19:48:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:42,256 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-02-10 19:48:42,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-02-10 19:48:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:42,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:42,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] [2020-02-10 19:48:42,257 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 962012855, now seen corresponding path program 509 times [2020-02-10 19:48:42,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:42,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362339018] [2020-02-10 19:48:42,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:42,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362339018] [2020-02-10 19:48:42,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:42,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:42,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626308730] [2020-02-10 19:48:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:42,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:42,624 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:48:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:42,750 INFO L93 Difference]: Finished difference Result 1408 states and 4927 transitions. [2020-02-10 19:48:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:42,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:42,754 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 19:48:42,754 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:48:42,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:48:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 19:48:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 19:48:42,776 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 19:48:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:42,776 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 19:48:42,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 19:48:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:42,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:42,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:42,778 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:42,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1722013483, now seen corresponding path program 510 times [2020-02-10 19:48:42,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:42,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241711695] [2020-02-10 19:48:42,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:43,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241711695] [2020-02-10 19:48:43,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:43,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:43,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985039468] [2020-02-10 19:48:43,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:43,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:43,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:43,145 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:48:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:43,281 INFO L93 Difference]: Finished difference Result 1412 states and 4932 transitions. [2020-02-10 19:48:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:43,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:43,285 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:48:43,285 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:48:43,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:48:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-02-10 19:48:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:48:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3134 transitions. [2020-02-10 19:48:43,307 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3134 transitions. Word has length 25 [2020-02-10 19:48:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:43,308 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3134 transitions. [2020-02-10 19:48:43,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3134 transitions. [2020-02-10 19:48:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:43,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:43,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:43,309 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1527934725, now seen corresponding path program 511 times [2020-02-10 19:48:43,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:43,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31038766] [2020-02-10 19:48:43,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:43,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31038766] [2020-02-10 19:48:43,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:43,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:43,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674500487] [2020-02-10 19:48:43,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:43,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:43,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:43,686 INFO L87 Difference]: Start difference. First operand 786 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:48:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:43,811 INFO L93 Difference]: Finished difference Result 1411 states and 4936 transitions. [2020-02-10 19:48:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:43,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:43,815 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:48:43,815 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:48:43,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:48:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 19:48:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:48:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3153 transitions. [2020-02-10 19:48:43,838 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3153 transitions. Word has length 25 [2020-02-10 19:48:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:43,838 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3153 transitions. [2020-02-10 19:48:43,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3153 transitions. [2020-02-10 19:48:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:43,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:43,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:43,839 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -547180007, now seen corresponding path program 512 times [2020-02-10 19:48:43,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:43,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652097018] [2020-02-10 19:48:43,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:44,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 19:48:44,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652097018] [2020-02-10 19:48:44,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:44,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:44,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843276755] [2020-02-10 19:48:44,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:44,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:44,214 INFO L87 Difference]: Start difference. First operand 793 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:48:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:44,336 INFO L93 Difference]: Finished difference Result 1410 states and 4931 transitions. [2020-02-10 19:48:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:44,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:44,340 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 19:48:44,340 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 19:48:44,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 19:48:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-02-10 19:48:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3145 transitions. [2020-02-10 19:48:44,363 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:44,363 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3145 transitions. [2020-02-10 19:48:44,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3145 transitions. [2020-02-10 19:48:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:44,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:44,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:44,364 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:44,365 INFO L82 PathProgramCache]: Analyzing trace with hash -44799787, now seen corresponding path program 513 times [2020-02-10 19:48:44,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:44,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257406418] [2020-02-10 19:48:44,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:44,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257406418] [2020-02-10 19:48:44,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:44,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:44,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809517062] [2020-02-10 19:48:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:44,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:44,753 INFO L87 Difference]: Start difference. First operand 790 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:44,895 INFO L93 Difference]: Finished difference Result 1419 states and 4949 transitions. [2020-02-10 19:48:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:44,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:44,898 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:48:44,898 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:48:44,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:48:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 795. [2020-02-10 19:48:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:48:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-02-10 19:48:44,921 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-02-10 19:48:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:44,921 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-02-10 19:48:44,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-02-10 19:48:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:44,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:44,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:44,922 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 967464243, now seen corresponding path program 514 times [2020-02-10 19:48:44,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:44,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378075961] [2020-02-10 19:48:44,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:45,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378075961] [2020-02-10 19:48:45,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:45,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151047860] [2020-02-10 19:48:45,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:45,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:45,298 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:48:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:45,398 INFO L93 Difference]: Finished difference Result 1424 states and 4954 transitions. [2020-02-10 19:48:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:45,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:45,402 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:48:45,402 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 19:48:45,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 19:48:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 790. [2020-02-10 19:48:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:48:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-02-10 19:48:45,424 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-02-10 19:48:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:45,425 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-02-10 19:48:45,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-02-10 19:48:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:45,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:45,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:45,426 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash 768233851, now seen corresponding path program 515 times [2020-02-10 19:48:45,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:45,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138392460] [2020-02-10 19:48:45,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:45,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138392460] [2020-02-10 19:48:45,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:45,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642560237] [2020-02-10 19:48:45,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:45,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:45,797 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:48:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:45,925 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-02-10 19:48:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:45,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:45,929 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:48:45,929 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 19:48:45,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 19:48:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 794. [2020-02-10 19:48:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:48:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3148 transitions. [2020-02-10 19:48:45,952 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3148 transitions. Word has length 25 [2020-02-10 19:48:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:45,953 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3148 transitions. [2020-02-10 19:48:45,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3148 transitions. [2020-02-10 19:48:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:45,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:45,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:45,954 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:45,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1306089429, now seen corresponding path program 516 times [2020-02-10 19:48:45,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:45,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304401210] [2020-02-10 19:48:45,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:46,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304401210] [2020-02-10 19:48:46,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:46,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:46,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116018848] [2020-02-10 19:48:46,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:46,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:46,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:46,327 INFO L87 Difference]: Start difference. First operand 794 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:48:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:46,426 INFO L93 Difference]: Finished difference Result 1422 states and 4946 transitions. [2020-02-10 19:48:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:46,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:46,430 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:48:46,430 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:48:46,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:48:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-02-10 19:48:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:48:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-02-10 19:48:46,452 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-02-10 19:48:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,452 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-02-10 19:48:46,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-02-10 19:48:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:46,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:46,453 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash -24386373, now seen corresponding path program 517 times [2020-02-10 19:48:46,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500343126] [2020-02-10 19:48:46,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:46,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 19:48:46,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500343126] [2020-02-10 19:48:46,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:46,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:46,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341428677] [2020-02-10 19:48:46,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:46,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:46,833 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:48:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:46,957 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 19:48:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:46,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:46,961 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:48:46,961 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 19:48:46,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 19:48:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 796. [2020-02-10 19:48:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:48:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3157 transitions. [2020-02-10 19:48:46,983 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3157 transitions. Word has length 25 [2020-02-10 19:48:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,983 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3157 transitions. [2020-02-10 19:48:46,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3157 transitions. [2020-02-10 19:48:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:46,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:46,985 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash 966871449, now seen corresponding path program 518 times [2020-02-10 19:48:46,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366828166] [2020-02-10 19:48:46,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:47,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366828166] [2020-02-10 19:48:47,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:47,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:47,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697488140] [2020-02-10 19:48:47,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:47,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:47,364 INFO L87 Difference]: Start difference. First operand 796 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:48:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:47,491 INFO L93 Difference]: Finished difference Result 1431 states and 4975 transitions. [2020-02-10 19:48:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:47,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:47,495 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 19:48:47,495 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 19:48:47,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 19:48:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 792. [2020-02-10 19:48:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-02-10 19:48:47,518 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-02-10 19:48:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:47,518 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-02-10 19:48:47,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-02-10 19:48:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:47,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:47,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:47,519 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -467285513, now seen corresponding path program 519 times [2020-02-10 19:48:47,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:47,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374705026] [2020-02-10 19:48:47,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:47,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374705026] [2020-02-10 19:48:47,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:47,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:47,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006496887] [2020-02-10 19:48:47,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:47,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:47,900 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:48:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:48,045 INFO L93 Difference]: Finished difference Result 1431 states and 4974 transitions. [2020-02-10 19:48:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:48,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:48,048 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 19:48:48,048 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:48:48,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:48:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 797. [2020-02-10 19:48:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:48:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3155 transitions. [2020-02-10 19:48:48,071 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3155 transitions. Word has length 25 [2020-02-10 19:48:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:48,071 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3155 transitions. [2020-02-10 19:48:48,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3155 transitions. [2020-02-10 19:48:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:48,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:48,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:48,072 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 544978517, now seen corresponding path program 520 times [2020-02-10 19:48:48,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:48,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061461234] [2020-02-10 19:48:48,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:48,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061461234] [2020-02-10 19:48:48,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:48,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:48,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764244039] [2020-02-10 19:48:48,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:48,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:48,460 INFO L87 Difference]: Start difference. First operand 797 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:48:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:48,571 INFO L93 Difference]: Finished difference Result 1436 states and 4979 transitions. [2020-02-10 19:48:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:48,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:48,575 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 19:48:48,575 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 19:48:48,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 19:48:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 792. [2020-02-10 19:48:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 19:48:48,598 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 19:48:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:48,598 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 19:48:48,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 19:48:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:48,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:48,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] [2020-02-10 19:48:48,599 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2012681989, now seen corresponding path program 521 times [2020-02-10 19:48:48,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:48,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083979808] [2020-02-10 19:48:48,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48: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 19:48:48,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083979808] [2020-02-10 19:48:48,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:48,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:48,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838373132] [2020-02-10 19:48:48,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:48,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:48,992 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:48:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:49,122 INFO L93 Difference]: Finished difference Result 1441 states and 4991 transitions. [2020-02-10 19:48:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:49,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:49,126 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 19:48:49,126 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 19:48:49,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 19:48:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 801. [2020-02-10 19:48:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:48:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3157 transitions. [2020-02-10 19:48:49,148 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3157 transitions. Word has length 25 [2020-02-10 19:48:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:49,149 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3157 transitions. [2020-02-10 19:48:49,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3157 transitions. [2020-02-10 19:48:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:49,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:49,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:49,150 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199927, now seen corresponding path program 522 times [2020-02-10 19:48:49,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:49,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785323999] [2020-02-10 19:48:49,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:49,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785323999] [2020-02-10 19:48:49,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:49,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:49,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202567982] [2020-02-10 19:48:49,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:49,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:49,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:49,549 INFO L87 Difference]: Start difference. First operand 801 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:48:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:49,660 INFO L93 Difference]: Finished difference Result 1443 states and 4987 transitions. [2020-02-10 19:48:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:49,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:49,664 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 19:48:49,664 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:48:49,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:48:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 786. [2020-02-10 19:48:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:48:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3125 transitions. [2020-02-10 19:48:49,687 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3125 transitions. Word has length 25 [2020-02-10 19:48:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:49,687 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3125 transitions. [2020-02-10 19:48:49,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3125 transitions. [2020-02-10 19:48:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:49,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:49,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:49,688 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1209830507, now seen corresponding path program 523 times [2020-02-10 19:48:49,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:49,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023369260] [2020-02-10 19:48:49,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:50,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 19:48:50,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023369260] [2020-02-10 19:48:50,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:50,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:50,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451188565] [2020-02-10 19:48:50,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:50,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:50,070 INFO L87 Difference]: Start difference. First operand 786 states and 3125 transitions. Second operand 10 states. [2020-02-10 19:48:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:50,196 INFO L93 Difference]: Finished difference Result 1421 states and 4949 transitions. [2020-02-10 19:48:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:50,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:50,200 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:48:50,200 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:48:50,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:48:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-02-10 19:48:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:48:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 19:48:50,223 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 19:48:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,223 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 19:48:50,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 19:48:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:50,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,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] [2020-02-10 19:48:50,224 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash 401110451, now seen corresponding path program 524 times [2020-02-10 19:48:50,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078791181] [2020-02-10 19:48:50,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:50,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 19:48:50,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078791181] [2020-02-10 19:48:50,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:50,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:50,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121372398] [2020-02-10 19:48:50,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:50,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:50,612 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:48:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:50,741 INFO L93 Difference]: Finished difference Result 1425 states and 4954 transitions. [2020-02-10 19:48:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:50,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:50,745 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 19:48:50,745 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:48:50,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:48:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 791. [2020-02-10 19:48:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-02-10 19:48:50,768 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-02-10 19:48:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,768 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-02-10 19:48:50,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-02-10 19:48:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:50,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,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] [2020-02-10 19:48:50,769 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash -115738919, now seen corresponding path program 525 times [2020-02-10 19:48:50,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547776074] [2020-02-10 19:48:50,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:51,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547776074] [2020-02-10 19:48:51,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:51,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:51,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483445072] [2020-02-10 19:48:51,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:51,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:51,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:51,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:51,149 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:48:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:51,277 INFO L93 Difference]: Finished difference Result 1424 states and 4951 transitions. [2020-02-10 19:48:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:51,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:51,281 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:48:51,281 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:48:51,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:48:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 19:48:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:48:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 19:48:51,326 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:51,326 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 19:48:51,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 19:48:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:51,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:51,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:51,327 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 422116659, now seen corresponding path program 526 times [2020-02-10 19:48:51,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:51,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035667328] [2020-02-10 19:48:51,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:51,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035667328] [2020-02-10 19:48:51,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:51,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:51,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041257830] [2020-02-10 19:48:51,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:51,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:51,707 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:51,812 INFO L93 Difference]: Finished difference Result 1430 states and 4959 transitions. [2020-02-10 19:48:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:51,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:51,816 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 19:48:51,816 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 19:48:51,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 19:48:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-02-10 19:48:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-02-10 19:48:51,839 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-02-10 19:48:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:51,839 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-02-10 19:48:51,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-02-10 19:48:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:51,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:51,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] [2020-02-10 19:48:51,841 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash -105235815, now seen corresponding path program 527 times [2020-02-10 19:48:51,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:51,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544437812] [2020-02-10 19:48:51,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,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 19:48:52,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544437812] [2020-02-10 19:48:52,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:52,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128388661] [2020-02-10 19:48:52,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:52,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:52,230 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:48:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:52,357 INFO L93 Difference]: Finished difference Result 1437 states and 4976 transitions. [2020-02-10 19:48:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:52,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:52,361 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 19:48:52,361 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 19:48:52,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 19:48:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 800. [2020-02-10 19:48:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:48:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3150 transitions. [2020-02-10 19:48:52,384 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3150 transitions. Word has length 25 [2020-02-10 19:48:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:52,384 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3150 transitions. [2020-02-10 19:48:52,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3150 transitions. [2020-02-10 19:48:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:52,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:52,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:52,385 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1178321195, now seen corresponding path program 528 times [2020-02-10 19:48:52,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:52,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126403575] [2020-02-10 19:48:52,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:52,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126403575] [2020-02-10 19:48:52,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:52,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455553232] [2020-02-10 19:48:52,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:52,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:52,779 INFO L87 Difference]: Start difference. First operand 800 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:48:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:52,924 INFO L93 Difference]: Finished difference Result 1439 states and 4972 transitions. [2020-02-10 19:48:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:52,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:52,928 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:48:52,928 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:48:52,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:48:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 781. [2020-02-10 19:48:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:48:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3111 transitions. [2020-02-10 19:48:52,951 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3111 transitions. Word has length 25 [2020-02-10 19:48:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:52,951 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3111 transitions. [2020-02-10 19:48:52,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3111 transitions. [2020-02-10 19:48:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:52,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:52,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:52,952 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1317604617, now seen corresponding path program 529 times [2020-02-10 19:48:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:52,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420973198] [2020-02-10 19:48:52,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:53,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 19:48:53,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420973198] [2020-02-10 19:48:53,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:53,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:53,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304483944] [2020-02-10 19:48:53,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:53,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:53,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:53,343 INFO L87 Difference]: Start difference. First operand 781 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:48:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:53,477 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-02-10 19:48:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:53,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:53,481 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 19:48:53,481 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 19:48:53,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 19:48:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-02-10 19:48:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 19:48:53,503 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:53,503 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 19:48:53,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 19:48:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:53,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:53,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] [2020-02-10 19:48:53,505 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash -336849899, now seen corresponding path program 530 times [2020-02-10 19:48:53,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:53,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748132215] [2020-02-10 19:48:53,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:53,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748132215] [2020-02-10 19:48:53,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:53,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:53,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867281170] [2020-02-10 19:48:53,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:53,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:53,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:53,892 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:54,031 INFO L93 Difference]: Finished difference Result 1395 states and 4897 transitions. [2020-02-10 19:48:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:54,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:54,034 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 19:48:54,034 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 19:48:54,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 19:48:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-02-10 19:48:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:48:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-02-10 19:48:54,057 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-02-10 19:48:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:54,057 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-02-10 19:48:54,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-02-10 19:48:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:54,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:54,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:54,058 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1760503757, now seen corresponding path program 531 times [2020-02-10 19:48:54,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:54,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390388910] [2020-02-10 19:48:54,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:54,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390388910] [2020-02-10 19:48:54,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:54,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:54,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698910730] [2020-02-10 19:48:54,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:54,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:54,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:54,450 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:48:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:54,581 INFO L93 Difference]: Finished difference Result 1399 states and 4906 transitions. [2020-02-10 19:48:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:54,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:54,585 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 19:48:54,585 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 19:48:54,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 19:48:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-02-10 19:48:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-02-10 19:48:54,608 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-02-10 19:48:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:54,608 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-02-10 19:48:54,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-02-10 19:48:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:54,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:54,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:54,610 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash -758742831, now seen corresponding path program 532 times [2020-02-10 19:48:54,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:54,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807248605] [2020-02-10 19:48:54,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:55,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807248605] [2020-02-10 19:48:55,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:55,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:55,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081809253] [2020-02-10 19:48:55,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:55,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:55,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:55,011 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:48:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:55,142 INFO L93 Difference]: Finished difference Result 1400 states and 4904 transitions. [2020-02-10 19:48:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:55,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:55,146 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 19:48:55,146 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 19:48:55,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 19:48:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-02-10 19:48:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:48:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 19:48:55,169 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 19:48:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:55,169 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 19:48:55,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 19:48:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:55,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:55,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:55,170 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:55,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash 652967735, now seen corresponding path program 533 times [2020-02-10 19:48:55,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:55,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199369141] [2020-02-10 19:48:55,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:55,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199369141] [2020-02-10 19:48:55,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:55,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:55,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240079385] [2020-02-10 19:48:55,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:55,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:55,544 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:48:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:55,672 INFO L93 Difference]: Finished difference Result 1396 states and 4896 transitions. [2020-02-10 19:48:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:55,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:55,675 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 19:48:55,675 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 19:48:55,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 19:48:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 791. [2020-02-10 19:48:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:48:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-02-10 19:48:55,697 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-02-10 19:48:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:55,697 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-02-10 19:48:55,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-02-10 19:48:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:55,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:55,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:55,698 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:55,699 INFO L82 PathProgramCache]: Analyzing trace with hash -420117645, now seen corresponding path program 534 times [2020-02-10 19:48:55,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:55,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513898285] [2020-02-10 19:48:55,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:56,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513898285] [2020-02-10 19:48:56,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:56,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:56,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090536380] [2020-02-10 19:48:56,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:56,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:56,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:56,072 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:48:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:56,202 INFO L93 Difference]: Finished difference Result 1398 states and 4897 transitions. [2020-02-10 19:48:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:56,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:56,206 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 19:48:56,206 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 19:48:56,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 19:48:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 785. [2020-02-10 19:48:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:48:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3126 transitions. [2020-02-10 19:48:56,228 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3126 transitions. Word has length 25 [2020-02-10 19:48:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:56,228 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3126 transitions. [2020-02-10 19:48:56,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3126 transitions. [2020-02-10 19:48:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:56,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:56,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:56,230 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1740090343, now seen corresponding path program 535 times [2020-02-10 19:48:56,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:56,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312440586] [2020-02-10 19:48:56,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:56,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312440586] [2020-02-10 19:48:56,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:56,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:56,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25462438] [2020-02-10 19:48:56,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:56,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:56,608 INFO L87 Difference]: Start difference. First operand 785 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:48:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:56,739 INFO L93 Difference]: Finished difference Result 1403 states and 4913 transitions. [2020-02-10 19:48:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:56,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:56,743 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 19:48:56,743 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:48:56,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:48:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 792. [2020-02-10 19:48:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:48:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 19:48:56,765 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 19:48:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:56,766 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 19:48:56,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 19:48:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:56,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:56,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:56,767 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -759335625, now seen corresponding path program 536 times [2020-02-10 19:48:56,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:56,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943603479] [2020-02-10 19:48:56,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:57,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943603479] [2020-02-10 19:48:57,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:57,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:57,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406721388] [2020-02-10 19:48:57,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:57,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:57,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:57,164 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:48:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:57,312 INFO L93 Difference]: Finished difference Result 1402 states and 4908 transitions. [2020-02-10 19:48:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:57,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:57,315 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 19:48:57,315 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 19:48:57,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 19:48:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 789. [2020-02-10 19:48:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:48:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3137 transitions. [2020-02-10 19:48:57,338 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3137 transitions. Word has length 25 [2020-02-10 19:48:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:57,338 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3137 transitions. [2020-02-10 19:48:57,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3137 transitions. [2020-02-10 19:48:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:57,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:57,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:57,339 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash -256955405, now seen corresponding path program 537 times [2020-02-10 19:48:57,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:57,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205182601] [2020-02-10 19:48:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:57,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205182601] [2020-02-10 19:48:57,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:57,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:57,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061818471] [2020-02-10 19:48:57,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:57,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:57,717 INFO L87 Difference]: Start difference. First operand 789 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:48:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:57,859 INFO L93 Difference]: Finished difference Result 1411 states and 4926 transitions. [2020-02-10 19:48:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:57,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:57,863 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 19:48:57,863 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:48:57,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:48:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 19:48:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:48:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 19:48:57,886 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 19:48:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:57,886 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 19:48:57,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 19:48:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:57,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:57,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:57,887 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 755308625, now seen corresponding path program 538 times [2020-02-10 19:48:57,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:57,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809501202] [2020-02-10 19:48:57,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:58,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 19:48:58,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809501202] [2020-02-10 19:48:58,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:58,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:58,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275041612] [2020-02-10 19:48:58,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:58,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:58,280 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:48:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:58,387 INFO L93 Difference]: Finished difference Result 1416 states and 4931 transitions. [2020-02-10 19:48:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:58,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:58,391 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:48:58,391 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:48:58,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:48:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 19:48:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:48:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3133 transitions. [2020-02-10 19:48:58,413 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3133 transitions. Word has length 25 [2020-02-10 19:48:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:58,413 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3133 transitions. [2020-02-10 19:48:58,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3133 transitions. [2020-02-10 19:48:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:58,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:58,415 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:58,415 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 556078233, now seen corresponding path program 539 times [2020-02-10 19:48:58,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:58,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032182928] [2020-02-10 19:48:58,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:58,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 19:48:58,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032182928] [2020-02-10 19:48:58,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:58,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:58,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355306171] [2020-02-10 19:48:58,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:58,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:58,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:58,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:58,783 INFO L87 Difference]: Start difference. First operand 789 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:48:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:58,921 INFO L93 Difference]: Finished difference Result 1408 states and 4915 transitions. [2020-02-10 19:48:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:58,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:58,925 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 19:48:58,925 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:48:58,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:48:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 793. [2020-02-10 19:48:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:48:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-02-10 19:48:58,948 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-02-10 19:48:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:58,948 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-02-10 19:48:58,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-02-10 19:48:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:58,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:58,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:58,949 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1093933811, now seen corresponding path program 540 times [2020-02-10 19:48:58,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:58,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478514922] [2020-02-10 19:48:58,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:59,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 19:48:59,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478514922] [2020-02-10 19:48:59,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:59,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:59,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334277935] [2020-02-10 19:48:59,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:59,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:59,329 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:48:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:59,455 INFO L93 Difference]: Finished difference Result 1414 states and 4923 transitions. [2020-02-10 19:48:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:59,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:59,459 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:48:59,459 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:48:59,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:48:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 785. [2020-02-10 19:48:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:48:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3122 transitions. [2020-02-10 19:48:59,481 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3122 transitions. Word has length 25 [2020-02-10 19:48:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:59,482 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3122 transitions. [2020-02-10 19:48:59,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:48:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3122 transitions. [2020-02-10 19:48:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:48:59,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:59,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] [2020-02-10 19:48:59,483 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1267006361, now seen corresponding path program 541 times [2020-02-10 19:48:59,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:59,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736656835] [2020-02-10 19:48:59,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:59,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736656835] [2020-02-10 19:48:59,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:59,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:48:59,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194349465] [2020-02-10 19:48:59,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:48:59,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:48:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:48:59,863 INFO L87 Difference]: Start difference. First operand 785 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:48:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:59,991 INFO L93 Difference]: Finished difference Result 1412 states and 4933 transitions. [2020-02-10 19:48:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:48:59,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:48:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:59,994 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:48:59,994 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:48:59,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:49:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-02-10 19:49:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-02-10 19:49:00,017 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-02-10 19:49:00,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:00,017 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-02-10 19:49:00,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-02-10 19:49:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:00,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:00,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:00,018 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2026200009, now seen corresponding path program 542 times [2020-02-10 19:49:00,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:00,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996205066] [2020-02-10 19:49:00,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:00,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996205066] [2020-02-10 19:49:00,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:00,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:00,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842643662] [2020-02-10 19:49:00,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:00,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:00,409 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:49:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:00,542 INFO L93 Difference]: Finished difference Result 1413 states and 4931 transitions. [2020-02-10 19:49:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:00,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:00,546 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 19:49:00,546 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 19:49:00,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 19:49:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-02-10 19:49:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:49:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-02-10 19:49:00,568 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:00,568 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-02-10 19:49:00,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-02-10 19:49:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:00,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:00,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:00,569 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1101926857, now seen corresponding path program 543 times [2020-02-10 19:49:00,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:00,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789796342] [2020-02-10 19:49:00,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:00,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789796342] [2020-02-10 19:49:00,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:00,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:00,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189553240] [2020-02-10 19:49:00,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:00,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:00,951 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:01,079 INFO L93 Difference]: Finished difference Result 1417 states and 4938 transitions. [2020-02-10 19:49:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:01,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:01,083 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:49:01,083 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 19:49:01,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 19:49:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-02-10 19:49:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 19:49:01,106 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 19:49:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:01,106 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 19:49:01,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 19:49:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:01,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:01,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:01,107 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash -89662827, now seen corresponding path program 544 times [2020-02-10 19:49:01,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:01,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413445072] [2020-02-10 19:49:01,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:01,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413445072] [2020-02-10 19:49:01,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:01,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996466413] [2020-02-10 19:49:01,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:01,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:01,490 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:49:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:01,623 INFO L93 Difference]: Finished difference Result 1422 states and 4943 transitions. [2020-02-10 19:49:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:01,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:01,627 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:49:01,627 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:49:01,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:49:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 19:49:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:49:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3131 transitions. [2020-02-10 19:49:01,649 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3131 transitions. Word has length 25 [2020-02-10 19:49:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:01,649 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3131 transitions. [2020-02-10 19:49:01,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3131 transitions. [2020-02-10 19:49:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:01,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:01,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] [2020-02-10 19:49:01,650 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:01,650 INFO L82 PathProgramCache]: Analyzing trace with hash -710786151, now seen corresponding path program 545 times [2020-02-10 19:49:01,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:01,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013434677] [2020-02-10 19:49:01,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:02,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013434677] [2020-02-10 19:49:02,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:02,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:02,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895706681] [2020-02-10 19:49:02,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:02,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:02,062 INFO L87 Difference]: Start difference. First operand 790 states and 3131 transitions. Second operand 10 states. [2020-02-10 19:49:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:02,193 INFO L93 Difference]: Finished difference Result 1420 states and 4940 transitions. [2020-02-10 19:49:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:02,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:02,196 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 19:49:02,197 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:49:02,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:49:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 796. [2020-02-10 19:49:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3142 transitions. [2020-02-10 19:49:02,219 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3142 transitions. Word has length 25 [2020-02-10 19:49:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:02,219 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3142 transitions. [2020-02-10 19:49:02,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3142 transitions. [2020-02-10 19:49:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:02,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:02,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:02,220 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 900154807, now seen corresponding path program 546 times [2020-02-10 19:49:02,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:02,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283537780] [2020-02-10 19:49:02,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:02,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283537780] [2020-02-10 19:49:02,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:02,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:02,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456062851] [2020-02-10 19:49:02,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:02,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:02,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:02,609 INFO L87 Difference]: Start difference. First operand 796 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:49:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:02,714 INFO L93 Difference]: Finished difference Result 1424 states and 4942 transitions. [2020-02-10 19:49:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:02,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:02,717 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:49:02,718 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 19:49:02,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 19:49:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2020-02-10 19:49:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:49:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3118 transitions. [2020-02-10 19:49:02,739 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3118 transitions. Word has length 25 [2020-02-10 19:49:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:02,740 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3118 transitions. [2020-02-10 19:49:02,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3118 transitions. [2020-02-10 19:49:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:02,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:02,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:02,741 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1518875627, now seen corresponding path program 547 times [2020-02-10 19:49:02,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:02,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209121135] [2020-02-10 19:49:02,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:03,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209121135] [2020-02-10 19:49:03,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:03,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:03,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781327282] [2020-02-10 19:49:03,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:03,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:03,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:03,118 INFO L87 Difference]: Start difference. First operand 785 states and 3118 transitions. Second operand 10 states. [2020-02-10 19:49:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:03,245 INFO L93 Difference]: Finished difference Result 1405 states and 4910 transitions. [2020-02-10 19:49:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:03,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:03,249 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 19:49:03,249 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 19:49:03,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 19:49:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-02-10 19:49:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 19:49:03,271 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 19:49:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:03,271 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 19:49:03,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 19:49:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:03,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:03,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:03,273 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1703006289, now seen corresponding path program 548 times [2020-02-10 19:49:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:03,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328028029] [2020-02-10 19:49:03,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:03,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328028029] [2020-02-10 19:49:03,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:03,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:03,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080144394] [2020-02-10 19:49:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:03,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:03,647 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:49:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:03,775 INFO L93 Difference]: Finished difference Result 1407 states and 4911 transitions. [2020-02-10 19:49:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:03,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:03,779 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 19:49:03,779 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 19:49:03,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 19:49:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 19:49:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-02-10 19:49:03,801 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-02-10 19:49:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:03,801 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-02-10 19:49:03,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-02-10 19:49:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:03,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:03,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:03,802 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1175653815, now seen corresponding path program 549 times [2020-02-10 19:49:03,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:03,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302556867] [2020-02-10 19:49:03,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:04,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302556867] [2020-02-10 19:49:04,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:04,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288385292] [2020-02-10 19:49:04,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:04,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:04,170 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:49:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:04,303 INFO L93 Difference]: Finished difference Result 1410 states and 4916 transitions. [2020-02-10 19:49:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:04,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:04,307 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 19:49:04,307 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:49:04,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:49:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 19:49:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3136 transitions. [2020-02-10 19:49:04,329 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:04,329 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3136 transitions. [2020-02-10 19:49:04,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3136 transitions. [2020-02-10 19:49:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:04,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:04,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:04,330 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:04,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1713509393, now seen corresponding path program 550 times [2020-02-10 19:49:04,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:04,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517164302] [2020-02-10 19:49:04,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:04,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517164302] [2020-02-10 19:49:04,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:04,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987766340] [2020-02-10 19:49:04,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:04,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:04,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:04,702 INFO L87 Difference]: Start difference. First operand 793 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:04,811 INFO L93 Difference]: Finished difference Result 1416 states and 4924 transitions. [2020-02-10 19:49:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:04,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:04,815 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:49:04,815 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 19:49:04,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 19:49:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 19:49:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3125 transitions. [2020-02-10 19:49:04,837 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3125 transitions. Word has length 25 [2020-02-10 19:49:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:04,837 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3125 transitions. [2020-02-10 19:49:04,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3125 transitions. [2020-02-10 19:49:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:04,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:04,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:04,838 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1196660023, now seen corresponding path program 551 times [2020-02-10 19:49:04,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:04,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984099973] [2020-02-10 19:49:04,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:05,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984099973] [2020-02-10 19:49:05,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:05,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:05,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980530487] [2020-02-10 19:49:05,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:05,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:05,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:05,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:05,218 INFO L87 Difference]: Start difference. First operand 789 states and 3125 transitions. Second operand 10 states. [2020-02-10 19:49:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:05,371 INFO L93 Difference]: Finished difference Result 1416 states and 4926 transitions. [2020-02-10 19:49:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:05,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:05,397 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:49:05,397 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:49:05,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:49:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-02-10 19:49:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3136 transitions. [2020-02-10 19:49:05,419 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:05,419 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3136 transitions. [2020-02-10 19:49:05,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3136 transitions. [2020-02-10 19:49:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:05,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:05,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:05,420 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1487366315, now seen corresponding path program 552 times [2020-02-10 19:49:05,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:05,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514202606] [2020-02-10 19:49:05,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:05,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514202606] [2020-02-10 19:49:05,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:05,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:05,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14966043] [2020-02-10 19:49:05,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:05,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:05,803 INFO L87 Difference]: Start difference. First operand 795 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:05,906 INFO L93 Difference]: Finished difference Result 1420 states and 4928 transitions. [2020-02-10 19:49:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:05,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:05,910 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 19:49:05,910 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 19:49:05,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 19:49:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 781. [2020-02-10 19:49:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:49:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 19:49:05,933 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 19:49:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:05,933 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 19:49:05,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 19:49:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:05,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:05,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:05,934 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash -26211883, now seen corresponding path program 553 times [2020-02-10 19:49:05,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:05,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147781872] [2020-02-10 19:49:05,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:06,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147781872] [2020-02-10 19:49:06,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:06,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:06,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869930533] [2020-02-10 19:49:06,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:06,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:06,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:06,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:06,300 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:49:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:06,432 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 19:49:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:06,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:06,436 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:49:06,436 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:49:06,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:49:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 19:49:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 19:49:06,459 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 19:49:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:06,459 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 19:49:06,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 19:49:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:06,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:06,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] [2020-02-10 19:49:06,460 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 965045939, now seen corresponding path program 554 times [2020-02-10 19:49:06,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:06,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125428872] [2020-02-10 19:49:06,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:06,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125428872] [2020-02-10 19:49:06,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:06,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:06,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015567963] [2020-02-10 19:49:06,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:06,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:06,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:06,836 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:49:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:06,969 INFO L93 Difference]: Finished difference Result 1432 states and 4990 transitions. [2020-02-10 19:49:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:06,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:06,973 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:49:06,973 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:49:06,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:49:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-02-10 19:49:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:49:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3144 transitions. [2020-02-10 19:49:06,995 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3144 transitions. Word has length 25 [2020-02-10 19:49:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:06,995 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3144 transitions. [2020-02-10 19:49:06,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3144 transitions. [2020-02-10 19:49:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:06,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:06,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:06,996 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1899822195, now seen corresponding path program 555 times [2020-02-10 19:49:06,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:06,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661239403] [2020-02-10 19:49:06,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:07,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661239403] [2020-02-10 19:49:07,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:07,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:07,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634851853] [2020-02-10 19:49:07,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:07,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:07,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:07,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:07,376 INFO L87 Difference]: Start difference. First operand 791 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:49:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:07,500 INFO L93 Difference]: Finished difference Result 1427 states and 4980 transitions. [2020-02-10 19:49:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:07,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:07,504 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 19:49:07,504 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:49:07,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:49:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 795. [2020-02-10 19:49:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 19:49:07,530 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 19:49:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:07,530 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 19:49:07,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 19:49:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:07,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:07,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] [2020-02-10 19:49:07,532 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:07,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1393384175, now seen corresponding path program 556 times [2020-02-10 19:49:07,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:07,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607252360] [2020-02-10 19:49:07,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:07,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607252360] [2020-02-10 19:49:07,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:07,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:07,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187989155] [2020-02-10 19:49:07,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:07,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:07,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:07,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:07,911 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:49:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:08,040 INFO L93 Difference]: Finished difference Result 1428 states and 4978 transitions. [2020-02-10 19:49:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:08,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:08,044 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:49:08,044 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:49:08,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:49:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-02-10 19:49:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:49:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-02-10 19:49:08,067 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-02-10 19:49:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:08,067 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-02-10 19:49:08,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-02-10 19:49:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:08,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:08,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:08,068 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1954863573, now seen corresponding path program 557 times [2020-02-10 19:49:08,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:08,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732220337] [2020-02-10 19:49:08,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:08,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 19:49:08,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732220337] [2020-02-10 19:49:08,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:08,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:08,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725013075] [2020-02-10 19:49:08,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:08,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:08,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:08,444 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:49:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:08,576 INFO L93 Difference]: Finished difference Result 1434 states and 4991 transitions. [2020-02-10 19:49:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:08,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:08,579 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:49:08,579 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:49:08,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:49:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-02-10 19:49:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3149 transitions. [2020-02-10 19:49:08,601 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3149 transitions. Word has length 25 [2020-02-10 19:49:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:08,602 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3149 transitions. [2020-02-10 19:49:08,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3149 transitions. [2020-02-10 19:49:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:08,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:08,603 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:08,603 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -729162765, now seen corresponding path program 558 times [2020-02-10 19:49:08,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:08,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984291175] [2020-02-10 19:49:08,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:08,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984291175] [2020-02-10 19:49:08,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:08,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:08,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349942896] [2020-02-10 19:49:08,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:08,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:08,974 INFO L87 Difference]: Start difference. First operand 796 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:49:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:09,120 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-02-10 19:49:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:09,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:09,124 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:49:09,124 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:49:09,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:49:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 787. [2020-02-10 19:49:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:49:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-02-10 19:49:09,146 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-02-10 19:49:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:09,146 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-02-10 19:49:09,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-02-10 19:49:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:09,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:09,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:09,147 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash -448697609, now seen corresponding path program 559 times [2020-02-10 19:49:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77423658] [2020-02-10 19:49:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:09,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77423658] [2020-02-10 19:49:09,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:09,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:09,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144698558] [2020-02-10 19:49:09,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:09,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:09,525 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:49:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:09,683 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-02-10 19:49:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:09,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:09,687 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:49:09,688 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 19:49:09,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 19:49:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 797. [2020-02-10 19:49:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:49:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-02-10 19:49:09,710 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-02-10 19:49:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:09,710 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-02-10 19:49:09,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-02-10 19:49:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:09,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:09,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:09,711 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash 542560213, now seen corresponding path program 560 times [2020-02-10 19:49:09,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:09,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718741219] [2020-02-10 19:49:09,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:10,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718741219] [2020-02-10 19:49:10,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:10,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:10,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831614647] [2020-02-10 19:49:10,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:10,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:10,087 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:49:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:10,217 INFO L93 Difference]: Finished difference Result 1443 states and 5009 transitions. [2020-02-10 19:49:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:10,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:10,221 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 19:49:10,221 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 19:49:10,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 19:49:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 793. [2020-02-10 19:49:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-02-10 19:49:10,243 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-02-10 19:49:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,244 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-02-10 19:49:10,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-02-10 19:49:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:10,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:10,245 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash -891596749, now seen corresponding path program 561 times [2020-02-10 19:49:10,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060044175] [2020-02-10 19:49:10,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:10,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060044175] [2020-02-10 19:49:10,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:10,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:10,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713861660] [2020-02-10 19:49:10,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:10,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:10,628 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:49:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:10,756 INFO L93 Difference]: Finished difference Result 1443 states and 5008 transitions. [2020-02-10 19:49:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:10,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:10,760 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 19:49:10,760 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:49:10,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:49:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-02-10 19:49:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3154 transitions. [2020-02-10 19:49:10,783 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3154 transitions. Word has length 25 [2020-02-10 19:49:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,783 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3154 transitions. [2020-02-10 19:49:10,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3154 transitions. [2020-02-10 19:49:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:10,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:10,785 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash 120667281, now seen corresponding path program 562 times [2020-02-10 19:49:10,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732686427] [2020-02-10 19:49:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:11,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732686427] [2020-02-10 19:49:11,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:11,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:11,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099816551] [2020-02-10 19:49:11,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:11,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:11,169 INFO L87 Difference]: Start difference. First operand 798 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:49:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:11,281 INFO L93 Difference]: Finished difference Result 1448 states and 5013 transitions. [2020-02-10 19:49:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:11,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:11,285 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 19:49:11,285 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 19:49:11,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 19:49:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 793. [2020-02-10 19:49:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-02-10 19:49:11,308 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-02-10 19:49:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:11,308 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-02-10 19:49:11,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-02-10 19:49:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:11,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:11,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:11,309 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1857974071, now seen corresponding path program 563 times [2020-02-10 19:49:11,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:11,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573442287] [2020-02-10 19:49:11,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:11,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 19:49:11,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573442287] [2020-02-10 19:49:11,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:11,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:11,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190465450] [2020-02-10 19:49:11,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:11,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:11,696 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:49:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:11,832 INFO L93 Difference]: Finished difference Result 1453 states and 5025 transitions. [2020-02-10 19:49:11,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:11,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:11,836 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 19:49:11,836 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 19:49:11,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 19:49:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 802. [2020-02-10 19:49:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:49:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3156 transitions. [2020-02-10 19:49:11,860 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3156 transitions. Word has length 25 [2020-02-10 19:49:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:11,860 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3156 transitions. [2020-02-10 19:49:11,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3156 transitions. [2020-02-10 19:49:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:11,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:11,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:11,861 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:11,861 INFO L82 PathProgramCache]: Analyzing trace with hash 784888691, now seen corresponding path program 564 times [2020-02-10 19:49:11,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:11,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109255051] [2020-02-10 19:49:11,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:12,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 19:49:12,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109255051] [2020-02-10 19:49:12,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:12,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:12,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347973299] [2020-02-10 19:49:12,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:12,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:12,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:12,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:12,260 INFO L87 Difference]: Start difference. First operand 802 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:49:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:12,376 INFO L93 Difference]: Finished difference Result 1455 states and 5021 transitions. [2020-02-10 19:49:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:12,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:12,380 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 19:49:12,380 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 19:49:12,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 19:49:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 787. [2020-02-10 19:49:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:49:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3123 transitions. [2020-02-10 19:49:12,402 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3123 transitions. Word has length 25 [2020-02-10 19:49:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:12,403 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3123 transitions. [2020-02-10 19:49:12,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3123 transitions. [2020-02-10 19:49:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:12,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:12,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:12,404 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1054850743, now seen corresponding path program 565 times [2020-02-10 19:49:12,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:12,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989199735] [2020-02-10 19:49:12,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:12,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 19:49:12,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989199735] [2020-02-10 19:49:12,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:12,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:12,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985042481] [2020-02-10 19:49:12,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:12,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:12,788 INFO L87 Difference]: Start difference. First operand 787 states and 3123 transitions. Second operand 10 states. [2020-02-10 19:49:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:12,946 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-02-10 19:49:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:12,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:12,950 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:49:12,950 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 19:49:12,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 19:49:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-02-10 19:49:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 19:49:12,973 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 19:49:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:12,973 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 19:49:12,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 19:49:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:12,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:12,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:12,975 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2056611669, now seen corresponding path program 566 times [2020-02-10 19:49:12,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:12,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292998576] [2020-02-10 19:49:12,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:13,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 19:49:13,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292998576] [2020-02-10 19:49:13,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:13,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:13,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249304090] [2020-02-10 19:49:13,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:13,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:13,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:13,365 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:49:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:13,523 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-02-10 19:49:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:13,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:13,526 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 19:49:13,526 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 19:49:13,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 19:49:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 792. [2020-02-10 19:49:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 19:49:13,549 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 19:49:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:13,549 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 19:49:13,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 19:49:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:13,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:13,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:13,551 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1314082475, now seen corresponding path program 567 times [2020-02-10 19:49:13,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:13,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451922105] [2020-02-10 19:49:13,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:13,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451922105] [2020-02-10 19:49:13,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:13,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:13,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78852066] [2020-02-10 19:49:13,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:13,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:13,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:13,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:13,924 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:49:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:14,067 INFO L93 Difference]: Finished difference Result 1437 states and 4989 transitions. [2020-02-10 19:49:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:14,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:14,071 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 19:49:14,071 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:49:14,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:49:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-02-10 19:49:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:49:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3146 transitions. [2020-02-10 19:49:14,094 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3146 transitions. Word has length 25 [2020-02-10 19:49:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:14,094 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3146 transitions. [2020-02-10 19:49:14,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3146 transitions. [2020-02-10 19:49:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:14,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:14,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:14,095 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -301818445, now seen corresponding path program 568 times [2020-02-10 19:49:14,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:14,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063978431] [2020-02-10 19:49:14,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:14,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063978431] [2020-02-10 19:49:14,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:14,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:14,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441845074] [2020-02-10 19:49:14,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:14,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:14,481 INFO L87 Difference]: Start difference. First operand 797 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:49:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:14,597 INFO L93 Difference]: Finished difference Result 1442 states and 4994 transitions. [2020-02-10 19:49:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:14,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:14,600 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 19:49:14,600 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 19:49:14,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 19:49:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-02-10 19:49:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3132 transitions. [2020-02-10 19:49:14,622 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3132 transitions. Word has length 25 [2020-02-10 19:49:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:14,623 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3132 transitions. [2020-02-10 19:49:14,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3132 transitions. [2020-02-10 19:49:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:14,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:14,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:14,624 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash -922941769, now seen corresponding path program 569 times [2020-02-10 19:49:14,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:14,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57109483] [2020-02-10 19:49:14,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:15,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57109483] [2020-02-10 19:49:15,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:15,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:15,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17849509] [2020-02-10 19:49:15,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:15,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:15,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:15,010 INFO L87 Difference]: Start difference. First operand 792 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:49:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:15,154 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-02-10 19:49:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:15,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:15,158 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:49:15,158 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 19:49:15,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 19:49:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-02-10 19:49:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3143 transitions. [2020-02-10 19:49:15,181 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3143 transitions. Word has length 25 [2020-02-10 19:49:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:15,181 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3143 transitions. [2020-02-10 19:49:15,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3143 transitions. [2020-02-10 19:49:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:15,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:15,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:15,182 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash 687999189, now seen corresponding path program 570 times [2020-02-10 19:49:15,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:15,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814587746] [2020-02-10 19:49:15,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:15,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814587746] [2020-02-10 19:49:15,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:15,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:15,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747367199] [2020-02-10 19:49:15,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:15,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:15,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:15,569 INFO L87 Difference]: Start difference. First operand 798 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:49:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:15,729 INFO L93 Difference]: Finished difference Result 1444 states and 4993 transitions. [2020-02-10 19:49:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:15,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:15,733 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:49:15,733 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 19:49:15,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 19:49:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 787. [2020-02-10 19:49:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:49:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3118 transitions. [2020-02-10 19:49:15,756 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3118 transitions. Word has length 25 [2020-02-10 19:49:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:15,756 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3118 transitions. [2020-02-10 19:49:15,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3118 transitions. [2020-02-10 19:49:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:15,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:15,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:15,758 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:15,758 INFO L82 PathProgramCache]: Analyzing trace with hash -216979789, now seen corresponding path program 571 times [2020-02-10 19:49:15,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:15,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217304461] [2020-02-10 19:49:15,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:16,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217304461] [2020-02-10 19:49:16,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:16,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:16,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741171288] [2020-02-10 19:49:16,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:16,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:16,135 INFO L87 Difference]: Start difference. First operand 787 states and 3118 transitions. Second operand 10 states. [2020-02-10 19:49:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:16,276 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-02-10 19:49:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:16,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:16,279 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:49:16,280 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 19:49:16,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 19:49:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 799. [2020-02-10 19:49:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:49:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3151 transitions. [2020-02-10 19:49:16,302 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3151 transitions. Word has length 25 [2020-02-10 19:49:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:16,302 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3151 transitions. [2020-02-10 19:49:16,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3151 transitions. [2020-02-10 19:49:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:16,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:16,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] [2020-02-10 19:49:16,303 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1393961169, now seen corresponding path program 572 times [2020-02-10 19:49:16,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:16,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542869546] [2020-02-10 19:49:16,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:16,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542869546] [2020-02-10 19:49:16,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:16,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:16,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521567426] [2020-02-10 19:49:16,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:16,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:16,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:16,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:16,678 INFO L87 Difference]: Start difference. First operand 799 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:49:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:16,838 INFO L93 Difference]: Finished difference Result 1447 states and 5010 transitions. [2020-02-10 19:49:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:16,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:16,842 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:49:16,842 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:49:16,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:49:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 794. [2020-02-10 19:49:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 19:49:16,864 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 19:49:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:16,865 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 19:49:16,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 19:49:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:16,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:16,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:16,866 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:16,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1817417643, now seen corresponding path program 573 times [2020-02-10 19:49:16,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:16,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820360832] [2020-02-10 19:49:16,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:17,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 19:49:17,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820360832] [2020-02-10 19:49:17,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:17,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:17,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660785997] [2020-02-10 19:49:17,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:17,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:17,251 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:49:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:17,436 INFO L93 Difference]: Finished difference Result 1457 states and 5030 transitions. [2020-02-10 19:49:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:17,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:17,439 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:49:17,440 INFO L226 Difference]: Without dead ends: 1441 [2020-02-10 19:49:17,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-02-10 19:49:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 803. [2020-02-10 19:49:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:49:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3153 transitions. [2020-02-10 19:49:17,462 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3153 transitions. Word has length 25 [2020-02-10 19:49:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:17,462 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3153 transitions. [2020-02-10 19:49:17,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3153 transitions. [2020-02-10 19:49:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:17,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:17,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:17,464 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1404464273, now seen corresponding path program 574 times [2020-02-10 19:49:17,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:17,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925027744] [2020-02-10 19:49:17,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:17,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925027744] [2020-02-10 19:49:17,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:17,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:17,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951074184] [2020-02-10 19:49:17,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:17,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:17,858 INFO L87 Difference]: Start difference. First operand 803 states and 3153 transitions. Second operand 10 states. [2020-02-10 19:49:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:17,985 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-02-10 19:49:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:17,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:17,988 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 19:49:17,988 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:49:17,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:49:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-02-10 19:49:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3130 transitions. [2020-02-10 19:49:18,010 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3130 transitions. Word has length 25 [2020-02-10 19:49:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:18,010 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3130 transitions. [2020-02-10 19:49:18,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3130 transitions. [2020-02-10 19:49:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:18,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:18,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:18,011 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1806914539, now seen corresponding path program 575 times [2020-02-10 19:49:18,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:18,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370626419] [2020-02-10 19:49:18,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:18,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370626419] [2020-02-10 19:49:18,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:18,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:18,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295846186] [2020-02-10 19:49:18,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:18,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:18,397 INFO L87 Difference]: Start difference. First operand 794 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:49:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:18,536 INFO L93 Difference]: Finished difference Result 1450 states and 5008 transitions. [2020-02-10 19:49:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:18,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:18,540 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:49:18,540 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:49:18,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:49:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 800. [2020-02-10 19:49:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:49:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-02-10 19:49:18,563 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-02-10 19:49:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:18,563 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-02-10 19:49:18,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-02-10 19:49:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:18,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:18,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:18,564 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash -195973581, now seen corresponding path program 576 times [2020-02-10 19:49:18,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:18,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738421539] [2020-02-10 19:49:18,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:18,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738421539] [2020-02-10 19:49:18,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:18,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:18,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311518309] [2020-02-10 19:49:18,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:18,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:18,950 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:49:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,071 INFO L93 Difference]: Finished difference Result 1454 states and 5010 transitions. [2020-02-10 19:49:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:19,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,075 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 19:49:19,075 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 19:49:19,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 19:49:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 781. [2020-02-10 19:49:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:49:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 19:49:19,097 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 19:49:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,098 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 19:49:19,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 19:49:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:19,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:19,099 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1108890727, now seen corresponding path program 577 times [2020-02-10 19:49:19,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179905490] [2020-02-10 19:49:19,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:19,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179905490] [2020-02-10 19:49:19,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:19,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:19,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178501268] [2020-02-10 19:49:19,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:19,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:19,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:19,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:19,485 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:49:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,659 INFO L93 Difference]: Finished difference Result 1414 states and 4936 transitions. [2020-02-10 19:49:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:19,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,663 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:49:19,663 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:49:19,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:49:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-02-10 19:49:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3139 transitions. [2020-02-10 19:49:19,685 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3139 transitions. Word has length 25 [2020-02-10 19:49:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,685 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3139 transitions. [2020-02-10 19:49:19,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3139 transitions. [2020-02-10 19:49:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:19,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:19,686 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash 502050231, now seen corresponding path program 578 times [2020-02-10 19:49:19,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624307935] [2020-02-10 19:49:19,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:20,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624307935] [2020-02-10 19:49:20,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:20,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:20,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371640702] [2020-02-10 19:49:20,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:20,046 INFO L87 Difference]: Start difference. First operand 792 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:49:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:20,202 INFO L93 Difference]: Finished difference Result 1418 states and 4941 transitions. [2020-02-10 19:49:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:20,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:20,206 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:49:20,206 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 19:49:20,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 19:49:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 789. [2020-02-10 19:49:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3131 transitions. [2020-02-10 19:49:20,228 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3131 transitions. Word has length 25 [2020-02-10 19:49:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:20,228 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3131 transitions. [2020-02-10 19:49:20,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3131 transitions. [2020-02-10 19:49:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:20,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:20,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:20,230 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1585638715, now seen corresponding path program 579 times [2020-02-10 19:49:20,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:20,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859907580] [2020-02-10 19:49:20,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:20,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 19:49:20,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859907580] [2020-02-10 19:49:20,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:20,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:20,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472340649] [2020-02-10 19:49:20,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:20,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:20,596 INFO L87 Difference]: Start difference. First operand 789 states and 3131 transitions. Second operand 10 states. [2020-02-10 19:49:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:20,753 INFO L93 Difference]: Finished difference Result 1412 states and 4929 transitions. [2020-02-10 19:49:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:20,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:20,776 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 19:49:20,777 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 19:49:20,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 19:49:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 792. [2020-02-10 19:49:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3136 transitions. [2020-02-10 19:49:20,798 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:20,799 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3136 transitions. [2020-02-10 19:49:20,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3136 transitions. [2020-02-10 19:49:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:20,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:20,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:20,800 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 512553335, now seen corresponding path program 580 times [2020-02-10 19:49:20,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:20,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901759839] [2020-02-10 19:49:20,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:21,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901759839] [2020-02-10 19:49:21,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:21,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:21,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337425202] [2020-02-10 19:49:21,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:21,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:21,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:21,164 INFO L87 Difference]: Start difference. First operand 792 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:21,318 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-02-10 19:49:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:21,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:21,322 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:49:21,322 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 19:49:21,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 19:49:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 789. [2020-02-10 19:49:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3128 transitions. [2020-02-10 19:49:21,344 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3128 transitions. Word has length 25 [2020-02-10 19:49:21,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:21,345 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3128 transitions. [2020-02-10 19:49:21,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3128 transitions. [2020-02-10 19:49:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:21,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:21,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:21,346 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1596141819, now seen corresponding path program 581 times [2020-02-10 19:49:21,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:21,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203873436] [2020-02-10 19:49:21,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:21,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 19:49:21,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203873436] [2020-02-10 19:49:21,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:21,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:21,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932275094] [2020-02-10 19:49:21,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:21,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:21,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:21,708 INFO L87 Difference]: Start difference. First operand 789 states and 3128 transitions. Second operand 10 states. [2020-02-10 19:49:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:21,857 INFO L93 Difference]: Finished difference Result 1422 states and 4948 transitions. [2020-02-10 19:49:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:21,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:21,861 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:49:21,861 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:49:21,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:49:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 19:49:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 19:49:21,883 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 19:49:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:21,883 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 19:49:21,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 19:49:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:21,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:21,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:21,884 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1087884519, now seen corresponding path program 582 times [2020-02-10 19:49:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:21,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474111025] [2020-02-10 19:49:21,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:22,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 19:49:22,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474111025] [2020-02-10 19:49:22,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:22,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:22,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023242407] [2020-02-10 19:49:22,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:22,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:22,254 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:49:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:22,412 INFO L93 Difference]: Finished difference Result 1420 states and 4939 transitions. [2020-02-10 19:49:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:22,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:22,415 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 19:49:22,415 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:49:22,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:49:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-02-10 19:49:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:49:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-02-10 19:49:22,437 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-02-10 19:49:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:22,437 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-02-10 19:49:22,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-02-10 19:49:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:22,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:22,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:22,439 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash 817143351, now seen corresponding path program 583 times [2020-02-10 19:49:22,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:22,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473633058] [2020-02-10 19:49:22,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:22,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 19:49:22,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473633058] [2020-02-10 19:49:22,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:22,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:22,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040509357] [2020-02-10 19:49:22,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:22,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:22,810 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:49:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:22,946 INFO L93 Difference]: Finished difference Result 1425 states and 4956 transitions. [2020-02-10 19:49:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:22,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:22,950 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 19:49:22,950 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 19:49:22,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 19:49:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 794. [2020-02-10 19:49:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-02-10 19:49:22,973 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-02-10 19:49:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:22,973 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-02-10 19:49:22,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-02-10 19:49:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:22,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:22,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:22,974 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1866882987, now seen corresponding path program 584 times [2020-02-10 19:49:22,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:22,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870506933] [2020-02-10 19:49:22,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:23,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870506933] [2020-02-10 19:49:23,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:23,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:23,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651097230] [2020-02-10 19:49:23,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:23,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:23,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:23,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:23,340 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:49:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:23,464 INFO L93 Difference]: Finished difference Result 1429 states and 4961 transitions. [2020-02-10 19:49:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:23,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:23,468 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:49:23,468 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:49:23,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:49:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-02-10 19:49:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:49:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3133 transitions. [2020-02-10 19:49:23,491 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3133 transitions. Word has length 25 [2020-02-10 19:49:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:23,491 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3133 transitions. [2020-02-10 19:49:23,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3133 transitions. [2020-02-10 19:49:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:23,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:23,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:23,492 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1911234939, now seen corresponding path program 585 times [2020-02-10 19:49:23,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:23,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618024790] [2020-02-10 19:49:23,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:23,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618024790] [2020-02-10 19:49:23,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:23,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:23,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548639964] [2020-02-10 19:49:23,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:23,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:23,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:23,854 INFO L87 Difference]: Start difference. First operand 791 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:49:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:23,979 INFO L93 Difference]: Finished difference Result 1428 states and 4958 transitions. [2020-02-10 19:49:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:23,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:23,983 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:49:23,983 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:49:23,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:49:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 19:49:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3140 transitions. [2020-02-10 19:49:24,004 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3140 transitions. Word has length 25 [2020-02-10 19:49:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,004 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3140 transitions. [2020-02-10 19:49:24,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3140 transitions. [2020-02-10 19:49:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:24,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:24,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:24,006 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1845876779, now seen corresponding path program 586 times [2020-02-10 19:49:24,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:24,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827102552] [2020-02-10 19:49:24,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:24,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827102552] [2020-02-10 19:49:24,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:24,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:24,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69519619] [2020-02-10 19:49:24,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:24,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:24,369 INFO L87 Difference]: Start difference. First operand 795 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:49:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:24,493 INFO L93 Difference]: Finished difference Result 1434 states and 4966 transitions. [2020-02-10 19:49:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:24,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:24,496 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:49:24,496 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:49:24,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:49:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-02-10 19:49:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:49:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3129 transitions. [2020-02-10 19:49:24,537 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3129 transitions. Word has length 25 [2020-02-10 19:49:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,537 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3129 transitions. [2020-02-10 19:49:24,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3129 transitions. [2020-02-10 19:49:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:24,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:24,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:24,539 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1921738043, now seen corresponding path program 587 times [2020-02-10 19:49:24,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:24,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20357412] [2020-02-10 19:49:24,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:24,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20357412] [2020-02-10 19:49:24,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:24,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:24,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231036521] [2020-02-10 19:49:24,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:24,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:24,911 INFO L87 Difference]: Start difference. First operand 791 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:49:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:25,055 INFO L93 Difference]: Finished difference Result 1441 states and 4983 transitions. [2020-02-10 19:49:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:25,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:25,059 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 19:49:25,059 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 19:49:25,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 19:49:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 800. [2020-02-10 19:49:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:49:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3145 transitions. [2020-02-10 19:49:25,081 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3145 transitions. Word has length 25 [2020-02-10 19:49:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:25,081 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3145 transitions. [2020-02-10 19:49:25,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3145 transitions. [2020-02-10 19:49:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:25,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:25,082 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:25,082 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:25,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:25,083 INFO L82 PathProgramCache]: Analyzing trace with hash 848652663, now seen corresponding path program 588 times [2020-02-10 19:49:25,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:25,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68864191] [2020-02-10 19:49:25,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:25,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 19:49:25,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68864191] [2020-02-10 19:49:25,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:25,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:25,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541028317] [2020-02-10 19:49:25,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:25,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:25,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:25,461 INFO L87 Difference]: Start difference. First operand 800 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:49:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:25,574 INFO L93 Difference]: Finished difference Result 1443 states and 4979 transitions. [2020-02-10 19:49:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:25,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:25,578 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 19:49:25,578 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 19:49:25,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 19:49:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 786. [2020-02-10 19:49:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:49:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3115 transitions. [2020-02-10 19:49:25,601 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3115 transitions. Word has length 25 [2020-02-10 19:49:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:25,601 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3115 transitions. [2020-02-10 19:49:25,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3115 transitions. [2020-02-10 19:49:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:25,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:25,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:25,602 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1142739575, now seen corresponding path program 589 times [2020-02-10 19:49:25,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:25,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919867014] [2020-02-10 19:49:25,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:25,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919867014] [2020-02-10 19:49:25,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:25,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:25,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369504120] [2020-02-10 19:49:25,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:25,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:25,968 INFO L87 Difference]: Start difference. First operand 786 states and 3115 transitions. Second operand 10 states. [2020-02-10 19:49:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:26,115 INFO L93 Difference]: Finished difference Result 1417 states and 4934 transitions. [2020-02-10 19:49:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:26,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:26,119 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:49:26,119 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 19:49:26,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 19:49:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 793. [2020-02-10 19:49:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3134 transitions. [2020-02-10 19:49:26,141 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3134 transitions. Word has length 25 [2020-02-10 19:49:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:26,142 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3134 transitions. [2020-02-10 19:49:26,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3134 transitions. [2020-02-10 19:49:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:26,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:26,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:26,143 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 69654195, now seen corresponding path program 590 times [2020-02-10 19:49:26,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:26,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013661340] [2020-02-10 19:49:26,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:26,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013661340] [2020-02-10 19:49:26,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:26,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:26,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592308091] [2020-02-10 19:49:26,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:26,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:26,524 INFO L87 Difference]: Start difference. First operand 793 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:49:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:26,651 INFO L93 Difference]: Finished difference Result 1419 states and 4935 transitions. [2020-02-10 19:49:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:26,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:26,655 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:49:26,655 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:49:26,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:49:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 19:49:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:49:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3126 transitions. [2020-02-10 19:49:26,677 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3126 transitions. Word has length 25 [2020-02-10 19:49:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:26,677 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3126 transitions. [2020-02-10 19:49:26,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3126 transitions. [2020-02-10 19:49:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:26,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:26,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:26,678 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash -457698279, now seen corresponding path program 591 times [2020-02-10 19:49:26,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:26,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741575047] [2020-02-10 19:49:26,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741575047] [2020-02-10 19:49:27,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:27,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717958604] [2020-02-10 19:49:27,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:27,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:27,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:27,035 INFO L87 Difference]: Start difference. First operand 790 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:49:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:27,166 INFO L93 Difference]: Finished difference Result 1422 states and 4940 transitions. [2020-02-10 19:49:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:27,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:27,170 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:49:27,170 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 19:49:27,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 19:49:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-02-10 19:49:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-02-10 19:49:27,204 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-02-10 19:49:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:27,204 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-02-10 19:49:27,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-02-10 19:49:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:27,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:27,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:27,206 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash 80157299, now seen corresponding path program 592 times [2020-02-10 19:49:27,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:27,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339689144] [2020-02-10 19:49:27,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:27,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339689144] [2020-02-10 19:49:27,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:27,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454096914] [2020-02-10 19:49:27,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:27,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:27,579 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:49:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:27,690 INFO L93 Difference]: Finished difference Result 1428 states and 4948 transitions. [2020-02-10 19:49:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:27,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:27,694 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:49:27,694 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:49:27,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:49:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 790. [2020-02-10 19:49:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:49:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3122 transitions. [2020-02-10 19:49:27,720 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3122 transitions. Word has length 25 [2020-02-10 19:49:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:27,720 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3122 transitions. [2020-02-10 19:49:27,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3122 transitions. [2020-02-10 19:49:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:27,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:27,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:27,721 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash -436692071, now seen corresponding path program 593 times [2020-02-10 19:49:27,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:27,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115383531] [2020-02-10 19:49:27,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:28,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115383531] [2020-02-10 19:49:28,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:28,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:28,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185045931] [2020-02-10 19:49:28,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:28,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:28,122 INFO L87 Difference]: Start difference. First operand 790 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:49:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:28,251 INFO L93 Difference]: Finished difference Result 1428 states and 4950 transitions. [2020-02-10 19:49:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:28,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:28,255 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:49:28,255 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:49:28,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:49:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-02-10 19:49:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3133 transitions. [2020-02-10 19:49:28,278 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3133 transitions. Word has length 25 [2020-02-10 19:49:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:28,278 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3133 transitions. [2020-02-10 19:49:28,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3133 transitions. [2020-02-10 19:49:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:28,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:28,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] [2020-02-10 19:49:28,279 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1174248887, now seen corresponding path program 594 times [2020-02-10 19:49:28,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126817624] [2020-02-10 19:49:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:28,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126817624] [2020-02-10 19:49:28,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:28,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:28,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198132527] [2020-02-10 19:49:28,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:28,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:28,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:28,705 INFO L87 Difference]: Start difference. First operand 796 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:49:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:28,829 INFO L93 Difference]: Finished difference Result 1432 states and 4952 transitions. [2020-02-10 19:49:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:28,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:28,832 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:49:28,832 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 19:49:28,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 19:49:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 786. [2020-02-10 19:49:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:49:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3111 transitions. [2020-02-10 19:49:28,854 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3111 transitions. Word has length 25 [2020-02-10 19:49:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:28,854 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3111 transitions. [2020-02-10 19:49:28,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3111 transitions. [2020-02-10 19:49:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:28,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:28,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:28,856 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1215690539, now seen corresponding path program 595 times [2020-02-10 19:49:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:28,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263227547] [2020-02-10 19:49:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:29,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 19:49:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263227547] [2020-02-10 19:49:29,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:29,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:29,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342820621] [2020-02-10 19:49:29,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:29,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:29,224 INFO L87 Difference]: Start difference. First operand 786 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:49:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:29,348 INFO L93 Difference]: Finished difference Result 1441 states and 4989 transitions. [2020-02-10 19:49:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:29,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:29,352 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 19:49:29,352 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 19:49:29,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 19:49:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 798. [2020-02-10 19:49:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-02-10 19:49:29,375 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-02-10 19:49:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:29,375 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-02-10 19:49:29,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-02-10 19:49:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:29,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:29,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:29,377 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash 395250419, now seen corresponding path program 596 times [2020-02-10 19:49:29,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:29,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535144733] [2020-02-10 19:49:29,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:29,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535144733] [2020-02-10 19:49:29,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:29,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:29,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79295608] [2020-02-10 19:49:29,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:29,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:29,746 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:49:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:29,887 INFO L93 Difference]: Finished difference Result 1439 states and 4980 transitions. [2020-02-10 19:49:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:29,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:29,890 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:49:29,890 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 19:49:29,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 19:49:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 793. [2020-02-10 19:49:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-02-10 19:49:29,913 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-02-10 19:49:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:29,913 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-02-10 19:49:29,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-02-10 19:49:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:29,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:29,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:29,915 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:29,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1478838903, now seen corresponding path program 597 times [2020-02-10 19:49:29,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:29,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557315867] [2020-02-10 19:49:29,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:30,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 19:49:30,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557315867] [2020-02-10 19:49:30,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:30,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:30,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844560736] [2020-02-10 19:49:30,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:30,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:30,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:30,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:30,299 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:49:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:30,433 INFO L93 Difference]: Finished difference Result 1449 states and 5000 transitions. [2020-02-10 19:49:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:30,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:30,437 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:49:30,437 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 19:49:30,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 19:49:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-02-10 19:49:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:49:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3146 transitions. [2020-02-10 19:49:30,459 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3146 transitions. Word has length 25 [2020-02-10 19:49:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:30,459 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3146 transitions. [2020-02-10 19:49:30,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3146 transitions. [2020-02-10 19:49:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:30,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:30,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] [2020-02-10 19:49:30,461 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 405753523, now seen corresponding path program 598 times [2020-02-10 19:49:30,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:30,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791909557] [2020-02-10 19:49:30,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:30,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791909557] [2020-02-10 19:49:30,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:30,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:30,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603067887] [2020-02-10 19:49:30,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:30,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:30,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:30,853 INFO L87 Difference]: Start difference. First operand 802 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:49:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:30,957 INFO L93 Difference]: Finished difference Result 1451 states and 4996 transitions. [2020-02-10 19:49:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:30,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:30,961 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 19:49:30,961 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:49:30,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:49:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-02-10 19:49:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3123 transitions. [2020-02-10 19:49:30,984 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3123 transitions. Word has length 25 [2020-02-10 19:49:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:30,984 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3123 transitions. [2020-02-10 19:49:30,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3123 transitions. [2020-02-10 19:49:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:30,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:30,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:30,985 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1489342007, now seen corresponding path program 599 times [2020-02-10 19:49:30,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:30,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109068245] [2020-02-10 19:49:30,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:31,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109068245] [2020-02-10 19:49:31,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:31,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919658370] [2020-02-10 19:49:31,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:31,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:31,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:31,363 INFO L87 Difference]: Start difference. First operand 793 states and 3123 transitions. Second operand 10 states. [2020-02-10 19:49:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:31,512 INFO L93 Difference]: Finished difference Result 1442 states and 4978 transitions. [2020-02-10 19:49:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:31,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:31,515 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 19:49:31,516 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:49:31,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:49:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 799. [2020-02-10 19:49:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:49:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3134 transitions. [2020-02-10 19:49:31,538 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3134 transitions. Word has length 25 [2020-02-10 19:49:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:31,539 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3134 transitions. [2020-02-10 19:49:31,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3134 transitions. [2020-02-10 19:49:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:31,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:31,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:31,540 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1194684331, now seen corresponding path program 600 times [2020-02-10 19:49:31,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:31,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219577518] [2020-02-10 19:49:31,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:31,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219577518] [2020-02-10 19:49:31,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:31,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143528575] [2020-02-10 19:49:31,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:31,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:31,946 INFO L87 Difference]: Start difference. First operand 799 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:49:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:32,061 INFO L93 Difference]: Finished difference Result 1446 states and 4980 transitions. [2020-02-10 19:49:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:32,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:32,065 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:49:32,065 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 19:49:32,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 19:49:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 776. [2020-02-10 19:49:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:49:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3088 transitions. [2020-02-10 19:49:32,088 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3088 transitions. Word has length 25 [2020-02-10 19:49:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:32,088 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3088 transitions. [2020-02-10 19:49:32,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3088 transitions. [2020-02-10 19:49:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:32,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:32,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:32,089 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:32,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2008365005, now seen corresponding path program 601 times [2020-02-10 19:49:32,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:32,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815615193] [2020-02-10 19:49:32,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:32,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815615193] [2020-02-10 19:49:32,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:32,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:32,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85315360] [2020-02-10 19:49:32,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:32,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:32,455 INFO L87 Difference]: Start difference. First operand 776 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:49:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:32,582 INFO L93 Difference]: Finished difference Result 1421 states and 4973 transitions. [2020-02-10 19:49:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:32,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:32,585 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:49:32,585 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 19:49:32,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 19:49:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 792. [2020-02-10 19:49:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 19:49:32,608 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 19:49:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:32,608 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 19:49:32,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 19:49:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:32,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:32,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:32,609 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash -397424047, now seen corresponding path program 602 times [2020-02-10 19:49:32,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:32,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676692539] [2020-02-10 19:49:32,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:32,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676692539] [2020-02-10 19:49:32,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:32,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:32,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108509260] [2020-02-10 19:49:32,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:32,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:32,977 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:49:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:33,104 INFO L93 Difference]: Finished difference Result 1418 states and 4964 transitions. [2020-02-10 19:49:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:33,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:33,108 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:49:33,108 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:49:33,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:49:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 789. [2020-02-10 19:49:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-02-10 19:49:33,133 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-02-10 19:49:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:33,134 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-02-10 19:49:33,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-02-10 19:49:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:33,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:33,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:33,135 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash 686164437, now seen corresponding path program 603 times [2020-02-10 19:49:33,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:33,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682567110] [2020-02-10 19:49:33,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:33,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 19:49:33,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682567110] [2020-02-10 19:49:33,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:33,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:33,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645076950] [2020-02-10 19:49:33,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:33,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:33,512 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:49:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:33,635 INFO L93 Difference]: Finished difference Result 1428 states and 4987 transitions. [2020-02-10 19:49:33,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:33,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:33,639 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 19:49:33,639 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 19:49:33,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 19:49:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 795. [2020-02-10 19:49:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3152 transitions. [2020-02-10 19:49:33,661 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3152 transitions. Word has length 25 [2020-02-10 19:49:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:33,662 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3152 transitions. [2020-02-10 19:49:33,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3152 transitions. [2020-02-10 19:49:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:33,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:33,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] [2020-02-10 19:49:33,663 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash -386920943, now seen corresponding path program 604 times [2020-02-10 19:49:33,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:33,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106853166] [2020-02-10 19:49:33,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:34,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106853166] [2020-02-10 19:49:34,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:34,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:34,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552377610] [2020-02-10 19:49:34,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:34,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:34,034 INFO L87 Difference]: Start difference. First operand 795 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:49:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:34,161 INFO L93 Difference]: Finished difference Result 1429 states and 4983 transitions. [2020-02-10 19:49:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:34,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:34,165 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:49:34,165 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 19:49:34,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 19:49:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 789. [2020-02-10 19:49:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-02-10 19:49:34,188 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-02-10 19:49:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:34,188 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-02-10 19:49:34,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-02-10 19:49:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:34,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:34,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:34,190 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 696667541, now seen corresponding path program 605 times [2020-02-10 19:49:34,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:34,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796814438] [2020-02-10 19:49:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:34,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 19:49:34,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796814438] [2020-02-10 19:49:34,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:34,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:34,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111774617] [2020-02-10 19:49:34,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:34,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:34,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:34,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:34,554 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:49:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:34,675 INFO L93 Difference]: Finished difference Result 1419 states and 4963 transitions. [2020-02-10 19:49:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:34,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:34,679 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 19:49:34,679 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 19:49:34,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 19:49:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 792. [2020-02-10 19:49:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3143 transitions. [2020-02-10 19:49:34,702 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3143 transitions. Word has length 25 [2020-02-10 19:49:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:34,702 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3143 transitions. [2020-02-10 19:49:34,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3143 transitions. [2020-02-10 19:49:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:34,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:34,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:34,703 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358797, now seen corresponding path program 606 times [2020-02-10 19:49:34,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:34,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621157675] [2020-02-10 19:49:34,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:35,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621157675] [2020-02-10 19:49:35,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:35,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:35,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629663527] [2020-02-10 19:49:35,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:35,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:35,080 INFO L87 Difference]: Start difference. First operand 792 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:49:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:35,218 INFO L93 Difference]: Finished difference Result 1423 states and 4968 transitions. [2020-02-10 19:49:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:35,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:35,221 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 19:49:35,222 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 19:49:35,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 19:49:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 786. [2020-02-10 19:49:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:49:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-02-10 19:49:35,243 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-02-10 19:49:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:35,243 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-02-10 19:49:35,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-02-10 19:49:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:35,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:35,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:35,245 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash -82330927, now seen corresponding path program 607 times [2020-02-10 19:49:35,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:35,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485059166] [2020-02-10 19:49:35,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:35,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485059166] [2020-02-10 19:49:35,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:35,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:35,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386979161] [2020-02-10 19:49:35,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:35,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:35,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:35,629 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:49:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:35,772 INFO L93 Difference]: Finished difference Result 1418 states and 4963 transitions. [2020-02-10 19:49:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:35,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:35,776 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 19:49:35,776 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:49:35,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:49:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-02-10 19:49:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-02-10 19:49:35,798 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-02-10 19:49:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:35,799 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-02-10 19:49:35,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-02-10 19:49:35,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:35,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:35,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:35,800 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:35,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1528610031, now seen corresponding path program 608 times [2020-02-10 19:49:35,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:35,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60193794] [2020-02-10 19:49:35,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:36,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 19:49:36,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60193794] [2020-02-10 19:49:36,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:36,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:36,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489910413] [2020-02-10 19:49:36,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:36,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:36,166 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:49:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:36,312 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-02-10 19:49:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:36,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:36,316 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 19:49:36,316 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 19:49:36,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:36,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 19:49:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-02-10 19:49:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-02-10 19:49:36,339 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-02-10 19:49:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:36,339 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-02-10 19:49:36,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-02-10 19:49:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:36,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:36,340 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:36,340 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1011760661, now seen corresponding path program 609 times [2020-02-10 19:49:36,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:36,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244278214] [2020-02-10 19:49:36,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:36,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 19:49:36,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244278214] [2020-02-10 19:49:36,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:36,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:36,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992307738] [2020-02-10 19:49:36,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:36,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:36,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:36,708 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:49:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:36,864 INFO L93 Difference]: Finished difference Result 1422 states and 4970 transitions. [2020-02-10 19:49:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:36,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:36,868 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 19:49:36,868 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 19:49:36,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 19:49:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 794. [2020-02-10 19:49:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-02-10 19:49:36,890 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-02-10 19:49:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:36,890 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-02-10 19:49:36,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-02-10 19:49:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:36,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:36,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:36,891 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1549616239, now seen corresponding path program 610 times [2020-02-10 19:49:36,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:36,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135878082] [2020-02-10 19:49:36,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:37,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135878082] [2020-02-10 19:49:37,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:37,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:37,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871952640] [2020-02-10 19:49:37,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:37,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:37,269 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:49:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:37,409 INFO L93 Difference]: Finished difference Result 1421 states and 4963 transitions. [2020-02-10 19:49:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:37,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:37,413 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:49:37,413 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:49:37,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:49:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-02-10 19:49:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3135 transitions. [2020-02-10 19:49:37,436 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3135 transitions. Word has length 25 [2020-02-10 19:49:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:37,436 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3135 transitions. [2020-02-10 19:49:37,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3135 transitions. [2020-02-10 19:49:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:37,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:37,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:37,437 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1022263765, now seen corresponding path program 611 times [2020-02-10 19:49:37,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:37,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226517034] [2020-02-10 19:49:37,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:37,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226517034] [2020-02-10 19:49:37,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:37,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:37,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662419575] [2020-02-10 19:49:37,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:37,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:37,802 INFO L87 Difference]: Start difference. First operand 789 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:49:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:37,940 INFO L93 Difference]: Finished difference Result 1414 states and 4949 transitions. [2020-02-10 19:49:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:37,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:37,944 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 19:49:37,944 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:49:37,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:49:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-02-10 19:49:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-02-10 19:49:37,966 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-02-10 19:49:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:37,966 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-02-10 19:49:37,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-02-10 19:49:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:37,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:37,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:37,968 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash -50821615, now seen corresponding path program 612 times [2020-02-10 19:49:37,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:37,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443053052] [2020-02-10 19:49:37,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:38,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443053052] [2020-02-10 19:49:38,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:38,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:38,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254886585] [2020-02-10 19:49:38,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:38,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:38,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:38,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:38,335 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:49:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:38,484 INFO L93 Difference]: Finished difference Result 1416 states and 4950 transitions. [2020-02-10 19:49:38,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:38,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:38,487 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 19:49:38,487 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 19:49:38,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 19:49:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-02-10 19:49:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:49:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3127 transitions. [2020-02-10 19:49:38,509 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3127 transitions. Word has length 25 [2020-02-10 19:49:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:38,510 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3127 transitions. [2020-02-10 19:49:38,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3127 transitions. [2020-02-10 19:49:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:38,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:38,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:38,511 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash 243265297, now seen corresponding path program 613 times [2020-02-10 19:49:38,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:38,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239469597] [2020-02-10 19:49:38,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:38,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239469597] [2020-02-10 19:49:38,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:38,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:38,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587042266] [2020-02-10 19:49:38,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:38,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:38,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:38,886 INFO L87 Difference]: Start difference. First operand 786 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:49:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:39,028 INFO L93 Difference]: Finished difference Result 1436 states and 5008 transitions. [2020-02-10 19:49:39,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:39,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:39,032 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 19:49:39,032 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 19:49:39,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 19:49:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 797. [2020-02-10 19:49:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:49:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3157 transitions. [2020-02-10 19:49:39,054 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3157 transitions. Word has length 25 [2020-02-10 19:49:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:39,054 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3157 transitions. [2020-02-10 19:49:39,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3157 transitions. [2020-02-10 19:49:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:39,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:39,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:39,056 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash -829820083, now seen corresponding path program 614 times [2020-02-10 19:49:39,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:39,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493919399] [2020-02-10 19:49:39,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:39,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 19:49:39,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493919399] [2020-02-10 19:49:39,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:39,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:39,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394098704] [2020-02-10 19:49:39,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:39,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:39,430 INFO L87 Difference]: Start difference. First operand 797 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:49:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:39,576 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-02-10 19:49:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:39,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:39,580 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 19:49:39,580 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 19:49:39,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 19:49:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-02-10 19:49:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:49:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3141 transitions. [2020-02-10 19:49:39,603 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3141 transitions. Word has length 25 [2020-02-10 19:49:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:39,603 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3141 transitions. [2020-02-10 19:49:39,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3141 transitions. [2020-02-10 19:49:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:39,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:39,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] [2020-02-10 19:49:39,604 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:39,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1357172557, now seen corresponding path program 615 times [2020-02-10 19:49:39,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:39,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772477223] [2020-02-10 19:49:39,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:39,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772477223] [2020-02-10 19:49:39,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:39,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:39,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145248545] [2020-02-10 19:49:39,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:39,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:39,981 INFO L87 Difference]: Start difference. First operand 791 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:49:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,137 INFO L93 Difference]: Finished difference Result 1433 states and 4996 transitions. [2020-02-10 19:49:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:40,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,141 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 19:49:40,141 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:49:40,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:49:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-02-10 19:49:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3150 transitions. [2020-02-10 19:49:40,164 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3150 transitions. Word has length 25 [2020-02-10 19:49:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,164 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3150 transitions. [2020-02-10 19:49:40,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3150 transitions. [2020-02-10 19:49:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:40,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:40,165 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash -819316979, now seen corresponding path program 616 times [2020-02-10 19:49:40,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526678741] [2020-02-10 19:49:40,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:40,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526678741] [2020-02-10 19:49:40,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:40,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:40,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991934559] [2020-02-10 19:49:40,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:40,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:40,540 INFO L87 Difference]: Start difference. First operand 796 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:49:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,687 INFO L93 Difference]: Finished difference Result 1432 states and 4989 transitions. [2020-02-10 19:49:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:40,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,691 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:49:40,691 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 19:49:40,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 19:49:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 791. [2020-02-10 19:49:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:49:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-02-10 19:49:40,714 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,714 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-02-10 19:49:40,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-02-10 19:49:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:40,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:40,715 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1336166349, now seen corresponding path program 617 times [2020-02-10 19:49:40,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052120799] [2020-02-10 19:49:40,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052120799] [2020-02-10 19:49:41,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:41,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:41,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792887427] [2020-02-10 19:49:41,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:41,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:41,087 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:41,235 INFO L93 Difference]: Finished difference Result 1435 states and 4995 transitions. [2020-02-10 19:49:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:41,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:41,239 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 19:49:41,239 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 19:49:41,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 19:49:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-02-10 19:49:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-02-10 19:49:41,261 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-02-10 19:49:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:41,262 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-02-10 19:49:41,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-02-10 19:49:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:41,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:41,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:41,263 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash 274774609, now seen corresponding path program 618 times [2020-02-10 19:49:41,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:41,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232112358] [2020-02-10 19:49:41,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:41,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232112358] [2020-02-10 19:49:41,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:41,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:41,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407022615] [2020-02-10 19:49:41,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:41,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:41,631 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:49:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:41,773 INFO L93 Difference]: Finished difference Result 1433 states and 4986 transitions. [2020-02-10 19:49:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:41,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:41,777 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 19:49:41,777 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:49:41,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:49:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 786. [2020-02-10 19:49:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:49:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3124 transitions. [2020-02-10 19:49:41,800 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3124 transitions. Word has length 25 [2020-02-10 19:49:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:41,800 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3124 transitions. [2020-02-10 19:49:41,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3124 transitions. [2020-02-10 19:49:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:41,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:41,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:41,801 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2115164817, now seen corresponding path program 619 times [2020-02-10 19:49:41,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:41,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150578820] [2020-02-10 19:49:41,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:42,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 19:49:42,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150578820] [2020-02-10 19:49:42,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:42,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:42,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212853023] [2020-02-10 19:49:42,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:42,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:42,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:42,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:42,165 INFO L87 Difference]: Start difference. First operand 786 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:49:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:42,293 INFO L93 Difference]: Finished difference Result 1417 states and 4955 transitions. [2020-02-10 19:49:42,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:42,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:42,297 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:49:42,297 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 19:49:42,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 19:49:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 792. [2020-02-10 19:49:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-02-10 19:49:42,340 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-02-10 19:49:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:42,340 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-02-10 19:49:42,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-02-10 19:49:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:42,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:42,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] [2020-02-10 19:49:42,341 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash -504223859, now seen corresponding path program 620 times [2020-02-10 19:49:42,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:42,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126427221] [2020-02-10 19:49:42,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:42,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 19:49:42,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126427221] [2020-02-10 19:49:42,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:42,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:42,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633749026] [2020-02-10 19:49:42,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:42,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:42,697 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:49:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:42,848 INFO L93 Difference]: Finished difference Result 1421 states and 4960 transitions. [2020-02-10 19:49:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:42,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:42,852 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 19:49:42,852 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 19:49:42,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 19:49:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-02-10 19:49:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-02-10 19:49:42,875 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-02-10 19:49:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:42,875 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-02-10 19:49:42,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-02-10 19:49:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:42,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:42,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:42,876 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:42,876 INFO L82 PathProgramCache]: Analyzing trace with hash 579364625, now seen corresponding path program 621 times [2020-02-10 19:49:42,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:42,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505488086] [2020-02-10 19:49:42,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:43,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505488086] [2020-02-10 19:49:43,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:43,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662687823] [2020-02-10 19:49:43,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:43,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:43,239 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:49:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:43,385 INFO L93 Difference]: Finished difference Result 1415 states and 4948 transitions. [2020-02-10 19:49:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:43,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:43,388 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 19:49:43,388 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 19:49:43,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 19:49:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-02-10 19:49:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 19:49:43,410 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 19:49:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:43,411 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 19:49:43,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 19:49:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:43,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:43,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:43,412 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:43,412 INFO L82 PathProgramCache]: Analyzing trace with hash -493720755, now seen corresponding path program 622 times [2020-02-10 19:49:43,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:43,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886887640] [2020-02-10 19:49:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:43,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886887640] [2020-02-10 19:49:43,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:43,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:43,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587761960] [2020-02-10 19:49:43,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:43,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:43,772 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:49:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:43,910 INFO L93 Difference]: Finished difference Result 1417 states and 4949 transitions. [2020-02-10 19:49:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:43,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:43,914 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 19:49:43,914 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 19:49:43,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 19:49:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-02-10 19:49:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-02-10 19:49:43,937 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-02-10 19:49:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:43,937 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-02-10 19:49:43,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-02-10 19:49:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:43,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:43,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] [2020-02-10 19:49:43,938 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 589867729, now seen corresponding path program 623 times [2020-02-10 19:49:43,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:43,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729012431] [2020-02-10 19:49:43,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:44,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729012431] [2020-02-10 19:49:44,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:44,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:44,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319714159] [2020-02-10 19:49:44,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:44,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:44,312 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-02-10 19:49:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:44,454 INFO L93 Difference]: Finished difference Result 1425 states and 4967 transitions. [2020-02-10 19:49:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:44,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:44,458 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 19:49:44,458 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:49:44,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:49:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-02-10 19:49:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-02-10 19:49:44,480 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-02-10 19:49:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:44,481 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-02-10 19:49:44,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-02-10 19:49:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:44,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:44,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:44,482 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2094158609, now seen corresponding path program 624 times [2020-02-10 19:49:44,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:44,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90655993] [2020-02-10 19:49:44,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:44,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 19:49:44,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90655993] [2020-02-10 19:49:44,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:44,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:44,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844662490] [2020-02-10 19:49:44,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:44,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:44,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:44,847 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:49:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:44,987 INFO L93 Difference]: Finished difference Result 1423 states and 4958 transitions. [2020-02-10 19:49:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:44,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:44,991 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 19:49:44,991 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 19:49:44,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 19:49:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 783. [2020-02-10 19:49:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:49:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 19:49:45,013 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 19:49:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,013 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 19:49:45,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 19:49:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:45,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:45,015 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1864116565, now seen corresponding path program 625 times [2020-02-10 19:49:45,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032527644] [2020-02-10 19:49:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:45,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032527644] [2020-02-10 19:49:45,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:45,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:45,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007296015] [2020-02-10 19:49:45,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:45,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:45,386 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:49:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:45,536 INFO L93 Difference]: Finished difference Result 1442 states and 5020 transitions. [2020-02-10 19:49:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:45,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:45,540 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 19:49:45,540 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 19:49:45,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 19:49:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 795. [2020-02-10 19:49:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 19:49:45,579 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 19:49:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,580 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 19:49:45,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 19:49:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:45,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,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] [2020-02-10 19:49:45,581 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash -819909773, now seen corresponding path program 626 times [2020-02-10 19:49:45,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317586641] [2020-02-10 19:49:45,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:45,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317586641] [2020-02-10 19:49:45,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:45,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:45,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813981822] [2020-02-10 19:49:45,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:45,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:45,953 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:49:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:46,102 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-02-10 19:49:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:46,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:46,106 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 19:49:46,106 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:49:46,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:49:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-02-10 19:49:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 19:49:46,129 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 19:49:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:46,129 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 19:49:46,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 19:49:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:46,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:46,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:46,130 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 263678711, now seen corresponding path program 627 times [2020-02-10 19:49:46,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:46,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382854716] [2020-02-10 19:49:46,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:46,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382854716] [2020-02-10 19:49:46,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:46,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:46,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490265180] [2020-02-10 19:49:46,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:46,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:46,507 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:49:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:46,644 INFO L93 Difference]: Finished difference Result 1449 states and 5034 transitions. [2020-02-10 19:49:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:46,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:46,648 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:49:46,648 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:49:46,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:49:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 798. [2020-02-10 19:49:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3158 transitions. [2020-02-10 19:49:46,670 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3158 transitions. Word has length 25 [2020-02-10 19:49:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:46,670 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3158 transitions. [2020-02-10 19:49:46,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3158 transitions. [2020-02-10 19:49:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:46,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:46,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:46,671 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash -809406669, now seen corresponding path program 628 times [2020-02-10 19:49:46,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:46,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026182550] [2020-02-10 19:49:46,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:47,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 19:49:47,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026182550] [2020-02-10 19:49:47,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:47,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:47,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167805554] [2020-02-10 19:49:47,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:47,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:47,047 INFO L87 Difference]: Start difference. First operand 798 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:49:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:47,200 INFO L93 Difference]: Finished difference Result 1450 states and 5030 transitions. [2020-02-10 19:49:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:47,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:47,204 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:49:47,204 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:49:47,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:49:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 792. [2020-02-10 19:49:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:49:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-02-10 19:49:47,227 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-02-10 19:49:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:47,227 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-02-10 19:49:47,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-02-10 19:49:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:47,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:47,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] [2020-02-10 19:49:47,228 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 274181815, now seen corresponding path program 629 times [2020-02-10 19:49:47,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:47,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671608747] [2020-02-10 19:49:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:47,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671608747] [2020-02-10 19:49:47,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:47,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:47,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410486868] [2020-02-10 19:49:47,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:47,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:47,604 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:49:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:47,754 INFO L93 Difference]: Finished difference Result 1440 states and 5010 transitions. [2020-02-10 19:49:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:47,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:47,758 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:49:47,758 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:49:47,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:49:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 795. [2020-02-10 19:49:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3149 transitions. [2020-02-10 19:49:47,781 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3149 transitions. Word has length 25 [2020-02-10 19:49:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:47,781 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3149 transitions. [2020-02-10 19:49:47,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3149 transitions. [2020-02-10 19:49:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:47,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:47,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] [2020-02-10 19:49:47,782 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1885122773, now seen corresponding path program 630 times [2020-02-10 19:49:47,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:47,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893999620] [2020-02-10 19:49:47,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:48,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893999620] [2020-02-10 19:49:48,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:48,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:48,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481279514] [2020-02-10 19:49:48,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:48,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:48,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:48,163 INFO L87 Difference]: Start difference. First operand 795 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:49:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,296 INFO L93 Difference]: Finished difference Result 1444 states and 5015 transitions. [2020-02-10 19:49:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:48,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,300 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:49:48,300 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 19:49:48,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 19:49:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 789. [2020-02-10 19:49:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-02-10 19:49:48,323 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,323 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-02-10 19:49:48,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-02-10 19:49:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:48,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:48,324 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1421217425, now seen corresponding path program 631 times [2020-02-10 19:49:48,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283206006] [2020-02-10 19:49:48,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:48,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283206006] [2020-02-10 19:49:48,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:48,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:48,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360592666] [2020-02-10 19:49:48,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:48,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:48,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:48,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:48,719 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,867 INFO L93 Difference]: Finished difference Result 1447 states and 5027 transitions. [2020-02-10 19:49:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:48,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,871 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:49:48,871 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:49:48,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:49:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 796. [2020-02-10 19:49:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:49:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3155 transitions. [2020-02-10 19:49:48,894 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3155 transitions. Word has length 25 [2020-02-10 19:49:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,894 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3155 transitions. [2020-02-10 19:49:48,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3155 transitions. [2020-02-10 19:49:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:48,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:48,895 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1262808913, now seen corresponding path program 632 times [2020-02-10 19:49:48,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607893899] [2020-02-10 19:49:48,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:49,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607893899] [2020-02-10 19:49:49,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:49,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:49,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035480279] [2020-02-10 19:49:49,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:49,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:49,284 INFO L87 Difference]: Start difference. First operand 796 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:49:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:49,421 INFO L93 Difference]: Finished difference Result 1444 states and 5018 transitions. [2020-02-10 19:49:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:49,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:49,425 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:49:49,425 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 19:49:49,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 19:49:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-02-10 19:49:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3147 transitions. [2020-02-10 19:49:49,448 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3147 transitions. Word has length 25 [2020-02-10 19:49:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:49,448 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3147 transitions. [2020-02-10 19:49:49,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3147 transitions. [2020-02-10 19:49:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:49,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:49,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:49,449 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 914871159, now seen corresponding path program 633 times [2020-02-10 19:49:49,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:49,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085792528] [2020-02-10 19:49:49,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:49,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 19:49:49,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085792528] [2020-02-10 19:49:49,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:49,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:49,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294701549] [2020-02-10 19:49:49,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:49,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:49,828 INFO L87 Difference]: Start difference. First operand 793 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:49:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:49,977 INFO L93 Difference]: Finished difference Result 1457 states and 5046 transitions. [2020-02-10 19:49:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:49,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:49,981 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:49:49,981 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 19:49:49,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 19:49:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 800. [2020-02-10 19:49:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:49:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3160 transitions. [2020-02-10 19:49:50,008 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3160 transitions. Word has length 25 [2020-02-10 19:49:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:50,008 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3160 transitions. [2020-02-10 19:49:50,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3160 transitions. [2020-02-10 19:49:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:50,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:50,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:50,009 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1231299601, now seen corresponding path program 634 times [2020-02-10 19:49:50,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:50,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404546263] [2020-02-10 19:49:50,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:50,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 19:49:50,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404546263] [2020-02-10 19:49:50,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:50,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:50,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831536336] [2020-02-10 19:49:50,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:50,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:50,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:50,391 INFO L87 Difference]: Start difference. First operand 800 states and 3160 transitions. Second operand 10 states. [2020-02-10 19:49:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:50,502 INFO L93 Difference]: Finished difference Result 1460 states and 5045 transitions. [2020-02-10 19:49:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:50,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:50,506 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 19:49:50,507 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 19:49:50,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 19:49:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 793. [2020-02-10 19:49:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-02-10 19:49:50,529 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-02-10 19:49:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:50,529 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-02-10 19:49:50,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-02-10 19:49:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:50,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:50,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:50,531 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 925374263, now seen corresponding path program 635 times [2020-02-10 19:49:50,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:50,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563099539] [2020-02-10 19:49:50,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:50,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563099539] [2020-02-10 19:49:50,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:50,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:50,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081396084] [2020-02-10 19:49:50,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:50,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:50,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:50,912 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:49:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:51,067 INFO L93 Difference]: Finished difference Result 1448 states and 5021 transitions. [2020-02-10 19:49:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:51,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:51,071 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 19:49:51,071 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:49:51,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:49:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-02-10 19:49:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:49:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3150 transitions. [2020-02-10 19:49:51,093 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3150 transitions. Word has length 25 [2020-02-10 19:49:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:51,094 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3150 transitions. [2020-02-10 19:49:51,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3150 transitions. [2020-02-10 19:49:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:51,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:51,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:51,095 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1463229841, now seen corresponding path program 636 times [2020-02-10 19:49:51,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:51,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765057692] [2020-02-10 19:49:51,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:51,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765057692] [2020-02-10 19:49:51,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:51,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:51,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661534003] [2020-02-10 19:49:51,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:51,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:51,477 INFO L87 Difference]: Start difference. First operand 797 states and 3150 transitions. Second operand 10 states. [2020-02-10 19:49:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:51,587 INFO L93 Difference]: Finished difference Result 1454 states and 5029 transitions. [2020-02-10 19:49:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:51,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:51,591 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 19:49:51,591 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:49:51,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:49:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 789. [2020-02-10 19:49:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-02-10 19:49:51,629 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-02-10 19:49:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:51,629 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-02-10 19:49:51,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-02-10 19:49:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:51,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:51,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:51,630 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1746813649, now seen corresponding path program 637 times [2020-02-10 19:49:51,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:51,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832382493] [2020-02-10 19:49:51,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:52,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832382493] [2020-02-10 19:49:52,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:52,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:52,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484939193] [2020-02-10 19:49:52,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:52,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:52,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:52,009 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:49:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:52,158 INFO L93 Difference]: Finished difference Result 1471 states and 5085 transitions. [2020-02-10 19:49:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:52,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:52,161 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 19:49:52,162 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 19:49:52,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 19:49:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 804. [2020-02-10 19:49:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:49:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3172 transitions. [2020-02-10 19:49:52,184 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3172 transitions. Word has length 25 [2020-02-10 19:49:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:52,184 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3172 transitions. [2020-02-10 19:49:52,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3172 transitions. [2020-02-10 19:49:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:52,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:52,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] [2020-02-10 19:49:52,185 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash 673728269, now seen corresponding path program 638 times [2020-02-10 19:49:52,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:52,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266618974] [2020-02-10 19:49:52,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:52,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 19:49:52,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266618974] [2020-02-10 19:49:52,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:52,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:52,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055039300] [2020-02-10 19:49:52,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:52,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:52,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:52,568 INFO L87 Difference]: Start difference. First operand 804 states and 3172 transitions. Second operand 10 states. [2020-02-10 19:49:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:52,709 INFO L93 Difference]: Finished difference Result 1472 states and 5081 transitions. [2020-02-10 19:49:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:52,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:52,713 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 19:49:52,713 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 19:49:52,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 19:49:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-02-10 19:49:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3155 transitions. [2020-02-10 19:49:52,735 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3155 transitions. Word has length 25 [2020-02-10 19:49:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:52,736 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3155 transitions. [2020-02-10 19:49:52,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3155 transitions. [2020-02-10 19:49:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:52,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:52,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:52,737 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1454062059, now seen corresponding path program 639 times [2020-02-10 19:49:52,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:52,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010862375] [2020-02-10 19:49:52,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:53,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010862375] [2020-02-10 19:49:53,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:53,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:53,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270338327] [2020-02-10 19:49:53,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:53,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:53,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:53,121 INFO L87 Difference]: Start difference. First operand 798 states and 3155 transitions. Second operand 10 states. [2020-02-10 19:49:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:53,249 INFO L93 Difference]: Finished difference Result 1474 states and 5084 transitions. [2020-02-10 19:49:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:53,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:53,253 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 19:49:53,253 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:49:53,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:49:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 805. [2020-02-10 19:49:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 19:49:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3168 transitions. [2020-02-10 19:49:53,275 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3168 transitions. Word has length 25 [2020-02-10 19:49:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:53,275 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3168 transitions. [2020-02-10 19:49:53,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3168 transitions. [2020-02-10 19:49:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:53,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:53,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:53,277 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 694734477, now seen corresponding path program 640 times [2020-02-10 19:49:53,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:53,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072678633] [2020-02-10 19:49:53,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:53,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072678633] [2020-02-10 19:49:53,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:53,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:53,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121077837] [2020-02-10 19:49:53,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:53,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:53,674 INFO L87 Difference]: Start difference. First operand 805 states and 3168 transitions. Second operand 10 states. [2020-02-10 19:49:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:53,791 INFO L93 Difference]: Finished difference Result 1477 states and 5083 transitions. [2020-02-10 19:49:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:53,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:53,795 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 19:49:53,795 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 19:49:53,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 19:49:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 798. [2020-02-10 19:49:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3148 transitions. [2020-02-10 19:49:53,818 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3148 transitions. Word has length 25 [2020-02-10 19:49:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:53,818 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3148 transitions. [2020-02-10 19:49:53,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3148 transitions. [2020-02-10 19:49:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:53,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:53,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:53,819 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1433055851, now seen corresponding path program 641 times [2020-02-10 19:49:53,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:53,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876888496] [2020-02-10 19:49:53,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:54,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876888496] [2020-02-10 19:49:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:54,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:54,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924949188] [2020-02-10 19:49:54,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:54,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:54,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:54,213 INFO L87 Difference]: Start difference. First operand 798 states and 3148 transitions. Second operand 10 states. [2020-02-10 19:49:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:54,365 INFO L93 Difference]: Finished difference Result 1478 states and 5085 transitions. [2020-02-10 19:49:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:54,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:54,369 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 19:49:54,369 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 19:49:54,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 19:49:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 807. [2020-02-10 19:49:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:49:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3164 transitions. [2020-02-10 19:49:54,392 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3164 transitions. Word has length 25 [2020-02-10 19:49:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:54,392 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3164 transitions. [2020-02-10 19:49:54,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3164 transitions. [2020-02-10 19:49:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:54,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:54,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:54,393 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1788826065, now seen corresponding path program 642 times [2020-02-10 19:49:54,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:54,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284582996] [2020-02-10 19:49:54,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:54,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284582996] [2020-02-10 19:49:54,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:54,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:54,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997546424] [2020-02-10 19:49:54,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:54,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:54,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:54,811 INFO L87 Difference]: Start difference. First operand 807 states and 3164 transitions. Second operand 10 states. [2020-02-10 19:49:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:54,942 INFO L93 Difference]: Finished difference Result 1480 states and 5081 transitions. [2020-02-10 19:49:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:54,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:54,946 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 19:49:54,946 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 19:49:54,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 19:49:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 789. [2020-02-10 19:49:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 19:49:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3126 transitions. [2020-02-10 19:49:54,969 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3126 transitions. Word has length 25 [2020-02-10 19:49:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:54,969 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3126 transitions. [2020-02-10 19:49:54,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3126 transitions. [2020-02-10 19:49:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:54,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:54,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:54,970 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:54,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash -611616465, now seen corresponding path program 643 times [2020-02-10 19:49:54,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:54,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252158443] [2020-02-10 19:49:54,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:55,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252158443] [2020-02-10 19:49:55,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:55,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:55,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037212576] [2020-02-10 19:49:55,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:55,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:55,349 INFO L87 Difference]: Start difference. First operand 789 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:49:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:55,496 INFO L93 Difference]: Finished difference Result 1449 states and 5021 transitions. [2020-02-10 19:49:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:55,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:55,500 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 19:49:55,500 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 19:49:55,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 19:49:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-02-10 19:49:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:49:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3147 transitions. [2020-02-10 19:49:55,523 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3147 transitions. Word has length 25 [2020-02-10 19:49:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:55,523 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3147 transitions. [2020-02-10 19:49:55,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3147 transitions. [2020-02-10 19:49:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:55,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:55,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] [2020-02-10 19:49:55,524 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash 999324493, now seen corresponding path program 644 times [2020-02-10 19:49:55,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:55,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884754256] [2020-02-10 19:49:55,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49: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 19:49:55,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884754256] [2020-02-10 19:49:55,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:55,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:55,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709585135] [2020-02-10 19:49:55,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:55,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:55,919 INFO L87 Difference]: Start difference. First operand 797 states and 3147 transitions. Second operand 10 states. [2020-02-10 19:49:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:56,053 INFO L93 Difference]: Finished difference Result 1453 states and 5026 transitions. [2020-02-10 19:49:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:56,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:56,057 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 19:49:56,058 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:49:56,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:49:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 794. [2020-02-10 19:49:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3139 transitions. [2020-02-10 19:49:56,080 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3139 transitions. Word has length 25 [2020-02-10 19:49:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:56,080 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3139 transitions. [2020-02-10 19:49:56,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3139 transitions. [2020-02-10 19:49:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:56,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:56,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:56,081 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash 482475123, now seen corresponding path program 645 times [2020-02-10 19:49:56,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:56,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297927822] [2020-02-10 19:49:56,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:56,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297927822] [2020-02-10 19:49:56,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:56,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:56,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836800022] [2020-02-10 19:49:56,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:56,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:56,466 INFO L87 Difference]: Start difference. First operand 794 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:49:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:56,591 INFO L93 Difference]: Finished difference Result 1452 states and 5023 transitions. [2020-02-10 19:49:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:56,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:56,595 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 19:49:56,595 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 19:49:56,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 19:49:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 798. [2020-02-10 19:49:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:49:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-02-10 19:49:56,618 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-02-10 19:49:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:56,619 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-02-10 19:49:56,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-02-10 19:49:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:56,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:56,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:56,620 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1020330701, now seen corresponding path program 646 times [2020-02-10 19:49:56,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:56,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984936632] [2020-02-10 19:49:56,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:57,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984936632] [2020-02-10 19:49:57,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:57,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:57,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966878890] [2020-02-10 19:49:57,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:57,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:57,007 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-02-10 19:49:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:57,135 INFO L93 Difference]: Finished difference Result 1458 states and 5031 transitions. [2020-02-10 19:49:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:57,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:57,138 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 19:49:57,138 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:49:57,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:49:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 794. [2020-02-10 19:49:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:49:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3135 transitions. [2020-02-10 19:49:57,160 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3135 transitions. Word has length 25 [2020-02-10 19:49:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:57,160 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3135 transitions. [2020-02-10 19:49:57,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3135 transitions. [2020-02-10 19:49:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:57,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:57,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:57,162 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash 492978227, now seen corresponding path program 647 times [2020-02-10 19:49:57,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:57,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143452010] [2020-02-10 19:49:57,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:57,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 19:49:57,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143452010] [2020-02-10 19:49:57,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:57,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:57,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581665748] [2020-02-10 19:49:57,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:57,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:57,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:57,564 INFO L87 Difference]: Start difference. First operand 794 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:49:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:57,712 INFO L93 Difference]: Finished difference Result 1465 states and 5048 transitions. [2020-02-10 19:49:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:57,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:57,716 INFO L225 Difference]: With dead ends: 1465 [2020-02-10 19:49:57,716 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 19:49:57,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 19:49:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 803. [2020-02-10 19:49:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:49:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3151 transitions. [2020-02-10 19:49:57,738 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3151 transitions. Word has length 25 [2020-02-10 19:49:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:57,738 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3151 transitions. [2020-02-10 19:49:57,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3151 transitions. [2020-02-10 19:49:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:57,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:57,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:57,740 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:57,740 INFO L82 PathProgramCache]: Analyzing trace with hash -580107153, now seen corresponding path program 648 times [2020-02-10 19:49:57,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:57,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334404871] [2020-02-10 19:49:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:58,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 19:49:58,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334404871] [2020-02-10 19:49:58,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:58,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:58,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450304853] [2020-02-10 19:49:58,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:58,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:58,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:58,133 INFO L87 Difference]: Start difference. First operand 803 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:49:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:58,236 INFO L93 Difference]: Finished difference Result 1467 states and 5044 transitions. [2020-02-10 19:49:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:58,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:58,240 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:49:58,240 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 19:49:58,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 19:49:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 783. [2020-02-10 19:49:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:49:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-02-10 19:49:58,262 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-02-10 19:49:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:58,262 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-02-10 19:49:58,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-02-10 19:49:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:58,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:58,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:58,263 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash -927302379, now seen corresponding path program 649 times [2020-02-10 19:49:58,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:58,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121598086] [2020-02-10 19:49:58,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:58,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121598086] [2020-02-10 19:49:58,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:58,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:58,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705253030] [2020-02-10 19:49:58,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:58,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:58,631 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:49:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:58,802 INFO L93 Difference]: Finished difference Result 1427 states and 4979 transitions. [2020-02-10 19:49:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:58,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:58,806 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 19:49:58,806 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:49:58,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:49:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 793. [2020-02-10 19:49:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:49:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3144 transitions. [2020-02-10 19:49:58,829 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3144 transitions. Word has length 25 [2020-02-10 19:49:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:58,830 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3144 transitions. [2020-02-10 19:49:58,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3144 transitions. [2020-02-10 19:49:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:58,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:58,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:58,831 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash 683638579, now seen corresponding path program 650 times [2020-02-10 19:49:58,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:58,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319431305] [2020-02-10 19:49:58,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:59,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319431305] [2020-02-10 19:49:59,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:59,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:59,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33892701] [2020-02-10 19:49:59,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:59,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:59,203 INFO L87 Difference]: Start difference. First operand 793 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:49:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:59,379 INFO L93 Difference]: Finished difference Result 1424 states and 4970 transitions. [2020-02-10 19:49:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:59,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:59,383 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 19:49:59,383 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 19:49:59,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 19:49:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-02-10 19:49:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:49:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-02-10 19:49:59,405 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-02-10 19:49:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:59,405 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-02-10 19:49:59,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-02-10 19:49:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:59,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:59,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:59,406 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:59,406 INFO L82 PathProgramCache]: Analyzing trace with hash 166789209, now seen corresponding path program 651 times [2020-02-10 19:49:59,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:59,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692095546] [2020-02-10 19:49:59,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:59,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692095546] [2020-02-10 19:49:59,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:59,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:49:59,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791185515] [2020-02-10 19:49:59,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:49:59,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:49:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:49:59,777 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:49:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:59,930 INFO L93 Difference]: Finished difference Result 1431 states and 4986 transitions. [2020-02-10 19:49:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:49:59,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:49:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:59,933 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 19:49:59,934 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:49:59,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:49:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 19:49:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:49:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 19:49:59,956 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 19:49:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:59,956 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 19:49:59,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:49:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 19:49:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:49:59,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:59,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] [2020-02-10 19:49:59,957 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:59,957 INFO L82 PathProgramCache]: Analyzing trace with hash 704644787, now seen corresponding path program 652 times [2020-02-10 19:49:59,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:59,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147279539] [2020-02-10 19:49:59,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:00,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147279539] [2020-02-10 19:50:00,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:00,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:00,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26858040] [2020-02-10 19:50:00,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:00,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:00,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:00,333 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 19:50:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:00,508 INFO L93 Difference]: Finished difference Result 1430 states and 4979 transitions. [2020-02-10 19:50:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:00,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:00,511 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 19:50:00,511 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 19:50:00,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 19:50:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 790. [2020-02-10 19:50:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 19:50:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3133 transitions. [2020-02-10 19:50:00,533 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3133 transitions. Word has length 25 [2020-02-10 19:50:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:00,533 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3133 transitions. [2020-02-10 19:50:00,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3133 transitions. [2020-02-10 19:50:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:00,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:00,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:00,535 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash 177292313, now seen corresponding path program 653 times [2020-02-10 19:50:00,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:00,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237456428] [2020-02-10 19:50:00,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:00,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 19:50:00,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237456428] [2020-02-10 19:50:00,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:00,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:00,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211950906] [2020-02-10 19:50:00,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:00,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:00,900 INFO L87 Difference]: Start difference. First operand 790 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:50:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:01,072 INFO L93 Difference]: Finished difference Result 1423 states and 4965 transitions. [2020-02-10 19:50:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:01,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:01,076 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 19:50:01,076 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 19:50:01,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 19:50:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 793. [2020-02-10 19:50:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:50:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-02-10 19:50:01,098 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-02-10 19:50:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:01,098 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-02-10 19:50:01,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-02-10 19:50:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:01,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:01,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:01,100 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash -895793067, now seen corresponding path program 654 times [2020-02-10 19:50:01,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:01,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351703265] [2020-02-10 19:50:01,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:01,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 19:50:01,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351703265] [2020-02-10 19:50:01,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:01,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:01,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706912110] [2020-02-10 19:50:01,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:01,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:01,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:01,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:01,471 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:50:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:01,631 INFO L93 Difference]: Finished difference Result 1425 states and 4966 transitions. [2020-02-10 19:50:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:01,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:01,635 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 19:50:01,636 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 19:50:01,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 19:50:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 787. [2020-02-10 19:50:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:50:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3125 transitions. [2020-02-10 19:50:01,660 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3125 transitions. Word has length 25 [2020-02-10 19:50:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:01,660 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3125 transitions. [2020-02-10 19:50:01,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3125 transitions. [2020-02-10 19:50:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:01,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:01,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:01,662 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:01,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash 998731699, now seen corresponding path program 655 times [2020-02-10 19:50:01,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:01,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908765433] [2020-02-10 19:50:01,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:02,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908765433] [2020-02-10 19:50:02,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:02,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:02,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297913868] [2020-02-10 19:50:02,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:02,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:02,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:02,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:02,055 INFO L87 Difference]: Start difference. First operand 787 states and 3125 transitions. Second operand 10 states. [2020-02-10 19:50:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:02,231 INFO L93 Difference]: Finished difference Result 1435 states and 4993 transitions. [2020-02-10 19:50:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:02,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:02,235 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 19:50:02,235 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 19:50:02,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 19:50:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-02-10 19:50:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:50:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3144 transitions. [2020-02-10 19:50:02,258 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3144 transitions. Word has length 25 [2020-02-10 19:50:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:02,258 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3144 transitions. [2020-02-10 19:50:02,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3144 transitions. [2020-02-10 19:50:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:02,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:02,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:02,260 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1685294639, now seen corresponding path program 656 times [2020-02-10 19:50:02,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:02,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267472142] [2020-02-10 19:50:02,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:02,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267472142] [2020-02-10 19:50:02,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:02,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:02,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969926580] [2020-02-10 19:50:02,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:02,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:02,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:02,651 INFO L87 Difference]: Start difference. First operand 794 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:50:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:02,790 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-02-10 19:50:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:02,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:02,794 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:50:02,794 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 19:50:02,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 19:50:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-02-10 19:50:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:50:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-02-10 19:50:02,816 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-02-10 19:50:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:02,817 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-02-10 19:50:02,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-02-10 19:50:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:02,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:02,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] [2020-02-10 19:50:02,818 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:02,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:02,818 INFO L82 PathProgramCache]: Analyzing trace with hash 492385433, now seen corresponding path program 657 times [2020-02-10 19:50:02,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:02,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170250695] [2020-02-10 19:50:02,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:03,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170250695] [2020-02-10 19:50:03,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:03,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:03,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881212848] [2020-02-10 19:50:03,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:03,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:03,199 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:50:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:03,357 INFO L93 Difference]: Finished difference Result 1445 states and 5012 transitions. [2020-02-10 19:50:03,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:03,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:03,361 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 19:50:03,361 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:50:03,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:50:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-02-10 19:50:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:50:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3149 transitions. [2020-02-10 19:50:03,384 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3149 transitions. Word has length 25 [2020-02-10 19:50:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:03,384 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3149 transitions. [2020-02-10 19:50:03,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3149 transitions. [2020-02-10 19:50:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:03,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:03,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:03,385 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1653785327, now seen corresponding path program 658 times [2020-02-10 19:50:03,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:03,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214735839] [2020-02-10 19:50:03,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:03,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214735839] [2020-02-10 19:50:03,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:03,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:03,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776036825] [2020-02-10 19:50:03,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:03,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:03,765 INFO L87 Difference]: Start difference. First operand 798 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:50:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:03,879 INFO L93 Difference]: Finished difference Result 1448 states and 5011 transitions. [2020-02-10 19:50:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:03,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:03,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:03,882 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 19:50:03,882 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 19:50:03,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 19:50:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 791. [2020-02-10 19:50:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:50:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3132 transitions. [2020-02-10 19:50:03,904 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3132 transitions. Word has length 25 [2020-02-10 19:50:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:03,904 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3132 transitions. [2020-02-10 19:50:03,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3132 transitions. [2020-02-10 19:50:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:03,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:03,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:03,905 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 502888537, now seen corresponding path program 659 times [2020-02-10 19:50:03,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:03,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729214419] [2020-02-10 19:50:03,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:04,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729214419] [2020-02-10 19:50:04,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:04,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:04,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699947407] [2020-02-10 19:50:04,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:04,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:04,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:04,287 INFO L87 Difference]: Start difference. First operand 791 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:50:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:04,432 INFO L93 Difference]: Finished difference Result 1436 states and 4987 transitions. [2020-02-10 19:50:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:04,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:04,436 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 19:50:04,436 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:50:04,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:50:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 795. [2020-02-10 19:50:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:50:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3139 transitions. [2020-02-10 19:50:04,459 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3139 transitions. Word has length 25 [2020-02-10 19:50:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:04,459 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3139 transitions. [2020-02-10 19:50:04,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3139 transitions. [2020-02-10 19:50:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:04,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:04,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] [2020-02-10 19:50:04,461 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1040744115, now seen corresponding path program 660 times [2020-02-10 19:50:04,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:04,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211205287] [2020-02-10 19:50:04,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:04,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211205287] [2020-02-10 19:50:04,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:04,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:04,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616576433] [2020-02-10 19:50:04,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:04,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:04,855 INFO L87 Difference]: Start difference. First operand 795 states and 3139 transitions. Second operand 10 states. [2020-02-10 19:50:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:04,970 INFO L93 Difference]: Finished difference Result 1442 states and 4995 transitions. [2020-02-10 19:50:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:04,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:04,974 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 19:50:04,974 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:50:04,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:50:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 787. [2020-02-10 19:50:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:50:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3121 transitions. [2020-02-10 19:50:04,996 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3121 transitions. Word has length 25 [2020-02-10 19:50:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:04,996 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3121 transitions. [2020-02-10 19:50:04,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3121 transitions. [2020-02-10 19:50:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:04,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:04,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:04,998 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:04,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1649924147, now seen corresponding path program 661 times [2020-02-10 19:50:04,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:04,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19019938] [2020-02-10 19:50:04,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:05,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19019938] [2020-02-10 19:50:05,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:05,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:05,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478047219] [2020-02-10 19:50:05,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:05,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:05,372 INFO L87 Difference]: Start difference. First operand 787 states and 3121 transitions. Second operand 10 states. [2020-02-10 19:50:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:05,544 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-02-10 19:50:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:05,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:05,547 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:50:05,547 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:50:05,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:50:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-02-10 19:50:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:50:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3152 transitions. [2020-02-10 19:50:05,570 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3152 transitions. Word has length 25 [2020-02-10 19:50:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:05,570 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3152 transitions. [2020-02-10 19:50:05,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3152 transitions. [2020-02-10 19:50:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:05,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:05,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] [2020-02-10 19:50:05,572 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2107187571, now seen corresponding path program 662 times [2020-02-10 19:50:05,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:05,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342311351] [2020-02-10 19:50:05,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:05,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342311351] [2020-02-10 19:50:05,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:05,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:05,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549601913] [2020-02-10 19:50:05,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:05,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:05,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:05,951 INFO L87 Difference]: Start difference. First operand 798 states and 3152 transitions. Second operand 10 states. [2020-02-10 19:50:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:06,122 INFO L93 Difference]: Finished difference Result 1446 states and 5016 transitions. [2020-02-10 19:50:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:06,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:06,125 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:50:06,125 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 19:50:06,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 19:50:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-02-10 19:50:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:50:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-02-10 19:50:06,148 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-02-10 19:50:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:06,148 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-02-10 19:50:06,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-02-10 19:50:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:06,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:06,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:06,150 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash 49486293, now seen corresponding path program 663 times [2020-02-10 19:50:06,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:06,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973759252] [2020-02-10 19:50:06,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:06,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973759252] [2020-02-10 19:50:06,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:06,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:06,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702822102] [2020-02-10 19:50:06,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:06,526 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:50:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:06,702 INFO L93 Difference]: Finished difference Result 1453 states and 5030 transitions. [2020-02-10 19:50:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:06,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:06,706 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 19:50:06,706 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 19:50:06,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 19:50:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 800. [2020-02-10 19:50:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:50:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3151 transitions. [2020-02-10 19:50:06,728 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3151 transitions. Word has length 25 [2020-02-10 19:50:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:06,728 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3151 transitions. [2020-02-10 19:50:06,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3151 transitions. [2020-02-10 19:50:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:06,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:06,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:06,730 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:06,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2096684467, now seen corresponding path program 664 times [2020-02-10 19:50:06,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:06,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894581141] [2020-02-10 19:50:06,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:07,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894581141] [2020-02-10 19:50:07,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:07,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:07,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939517391] [2020-02-10 19:50:07,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:07,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:07,122 INFO L87 Difference]: Start difference. First operand 800 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:50:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:07,237 INFO L93 Difference]: Finished difference Result 1456 states and 5029 transitions. [2020-02-10 19:50:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:07,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:07,241 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 19:50:07,241 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 19:50:07,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 19:50:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 793. [2020-02-10 19:50:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:50:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3132 transitions. [2020-02-10 19:50:07,263 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3132 transitions. Word has length 25 [2020-02-10 19:50:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:07,263 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3132 transitions. [2020-02-10 19:50:07,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3132 transitions. [2020-02-10 19:50:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:07,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:07,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:07,264 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 80995605, now seen corresponding path program 665 times [2020-02-10 19:50:07,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:07,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967519562] [2020-02-10 19:50:07,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:07,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967519562] [2020-02-10 19:50:07,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:07,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:07,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455114412] [2020-02-10 19:50:07,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:07,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:07,645 INFO L87 Difference]: Start difference. First operand 793 states and 3132 transitions. Second operand 10 states. [2020-02-10 19:50:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:07,798 INFO L93 Difference]: Finished difference Result 1450 states and 5017 transitions. [2020-02-10 19:50:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:07,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:07,802 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:50:07,802 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 19:50:07,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 19:50:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-02-10 19:50:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:50:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3143 transitions. [2020-02-10 19:50:07,824 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3143 transitions. Word has length 25 [2020-02-10 19:50:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:07,824 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3143 transitions. [2020-02-10 19:50:07,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3143 transitions. [2020-02-10 19:50:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:07,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:07,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] [2020-02-10 19:50:07,825 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1691936563, now seen corresponding path program 666 times [2020-02-10 19:50:07,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:07,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584144009] [2020-02-10 19:50:07,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:08,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584144009] [2020-02-10 19:50:08,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:08,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:08,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255188919] [2020-02-10 19:50:08,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:08,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:08,203 INFO L87 Difference]: Start difference. First operand 799 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:50:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:08,324 INFO L93 Difference]: Finished difference Result 1454 states and 5019 transitions. [2020-02-10 19:50:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:08,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:08,328 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 19:50:08,328 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:50:08,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:50:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 787. [2020-02-10 19:50:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:50:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3117 transitions. [2020-02-10 19:50:08,350 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3117 transitions. Word has length 25 [2020-02-10 19:50:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:08,350 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3117 transitions. [2020-02-10 19:50:08,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3117 transitions. [2020-02-10 19:50:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:08,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:08,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:08,352 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash -708505967, now seen corresponding path program 667 times [2020-02-10 19:50:08,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:08,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274390724] [2020-02-10 19:50:08,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:08,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274390724] [2020-02-10 19:50:08,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:08,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:08,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217422875] [2020-02-10 19:50:08,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:08,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:08,719 INFO L87 Difference]: Start difference. First operand 787 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:50:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:08,858 INFO L93 Difference]: Finished difference Result 1429 states and 4972 transitions. [2020-02-10 19:50:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:08,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:08,862 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 19:50:08,862 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 19:50:08,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 19:50:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-02-10 19:50:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:50:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-02-10 19:50:08,885 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-02-10 19:50:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:08,885 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-02-10 19:50:08,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-02-10 19:50:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:08,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:08,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:08,887 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1781591347, now seen corresponding path program 668 times [2020-02-10 19:50:08,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:08,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052338276] [2020-02-10 19:50:08,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:09,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052338276] [2020-02-10 19:50:09,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:09,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:09,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616269161] [2020-02-10 19:50:09,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:09,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:09,264 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:50:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:09,442 INFO L93 Difference]: Finished difference Result 1431 states and 4973 transitions. [2020-02-10 19:50:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:09,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:09,446 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 19:50:09,446 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 19:50:09,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 19:50:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-02-10 19:50:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:50:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-02-10 19:50:09,468 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-02-10 19:50:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:09,468 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-02-10 19:50:09,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-02-10 19:50:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:09,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:09,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:09,469 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1986023475, now seen corresponding path program 669 times [2020-02-10 19:50:09,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:09,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42893017] [2020-02-10 19:50:09,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:09,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 19:50:09,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42893017] [2020-02-10 19:50:09,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:09,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:09,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687287737] [2020-02-10 19:50:09,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:09,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:09,833 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-02-10 19:50:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:10,005 INFO L93 Difference]: Finished difference Result 1434 states and 4978 transitions. [2020-02-10 19:50:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:10,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:10,009 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 19:50:10,009 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 19:50:10,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 19:50:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-02-10 19:50:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:50:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3135 transitions. [2020-02-10 19:50:10,032 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3135 transitions. Word has length 25 [2020-02-10 19:50:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:10,032 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3135 transitions. [2020-02-10 19:50:10,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3135 transitions. [2020-02-10 19:50:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:10,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:10,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:10,033 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:10,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1771088243, now seen corresponding path program 670 times [2020-02-10 19:50:10,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:10,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10062460] [2020-02-10 19:50:10,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:10,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10062460] [2020-02-10 19:50:10,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:10,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:10,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214537282] [2020-02-10 19:50:10,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:10,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:10,394 INFO L87 Difference]: Start difference. First operand 795 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:50:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:10,489 INFO L93 Difference]: Finished difference Result 1440 states and 4986 transitions. [2020-02-10 19:50:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:10,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:10,493 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:50:10,493 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:50:10,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:50:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-02-10 19:50:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:50:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3124 transitions. [2020-02-10 19:50:10,516 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3124 transitions. Word has length 25 [2020-02-10 19:50:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:10,516 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3124 transitions. [2020-02-10 19:50:10,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3124 transitions. [2020-02-10 19:50:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:10,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:10,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:10,517 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2007029683, now seen corresponding path program 671 times [2020-02-10 19:50:10,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:10,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087858681] [2020-02-10 19:50:10,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:10,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 19:50:10,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087858681] [2020-02-10 19:50:10,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:10,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:10,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626877622] [2020-02-10 19:50:10,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:10,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:10,884 INFO L87 Difference]: Start difference. First operand 791 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:50:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:11,022 INFO L93 Difference]: Finished difference Result 1440 states and 4988 transitions. [2020-02-10 19:50:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:11,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:11,026 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:50:11,026 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 19:50:11,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 19:50:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 797. [2020-02-10 19:50:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:50:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3135 transitions. [2020-02-10 19:50:11,048 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3135 transitions. Word has length 25 [2020-02-10 19:50:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:11,049 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3135 transitions. [2020-02-10 19:50:11,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3135 transitions. [2020-02-10 19:50:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:11,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:11,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:11,050 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash -676996655, now seen corresponding path program 672 times [2020-02-10 19:50:11,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:11,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299704729] [2020-02-10 19:50:11,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:11,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299704729] [2020-02-10 19:50:11,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:11,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:11,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145761008] [2020-02-10 19:50:11,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:11,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:11,432 INFO L87 Difference]: Start difference. First operand 797 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:50:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:11,530 INFO L93 Difference]: Finished difference Result 1444 states and 4990 transitions. [2020-02-10 19:50:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:11,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:11,534 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 19:50:11,534 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:50:11,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:50:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 783. [2020-02-10 19:50:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:50:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3106 transitions. [2020-02-10 19:50:11,557 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3106 transitions. Word has length 25 [2020-02-10 19:50:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:11,557 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3106 transitions. [2020-02-10 19:50:11,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3106 transitions. [2020-02-10 19:50:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:11,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:11,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:11,559 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1024191881, now seen corresponding path program 673 times [2020-02-10 19:50:11,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:11,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483971098] [2020-02-10 19:50:11,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:11,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483971098] [2020-02-10 19:50:11,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:11,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:11,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187164736] [2020-02-10 19:50:11,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:11,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:11,946 INFO L87 Difference]: Start difference. First operand 783 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:50:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:12,070 INFO L93 Difference]: Finished difference Result 1474 states and 5108 transitions. [2020-02-10 19:50:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:12,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:12,074 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 19:50:12,074 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 19:50:12,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 19:50:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 803. [2020-02-10 19:50:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:50:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3170 transitions. [2020-02-10 19:50:12,097 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3170 transitions. Word has length 25 [2020-02-10 19:50:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:12,097 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3170 transitions. [2020-02-10 19:50:12,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3170 transitions. [2020-02-10 19:50:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:12,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:12,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:12,098 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2097277261, now seen corresponding path program 674 times [2020-02-10 19:50:12,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:12,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127093436] [2020-02-10 19:50:12,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:12,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127093436] [2020-02-10 19:50:12,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:12,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:12,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279186191] [2020-02-10 19:50:12,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:12,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:12,480 INFO L87 Difference]: Start difference. First operand 803 states and 3170 transitions. Second operand 10 states. [2020-02-10 19:50:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:12,598 INFO L93 Difference]: Finished difference Result 1475 states and 5104 transitions. [2020-02-10 19:50:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:12,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:12,601 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:50:12,602 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 19:50:12,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 19:50:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 797. [2020-02-10 19:50:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:50:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-02-10 19:50:12,624 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-02-10 19:50:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:12,624 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-02-10 19:50:12,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-02-10 19:50:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:12,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:12,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:12,625 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:12,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1670337561, now seen corresponding path program 675 times [2020-02-10 19:50:12,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:12,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349233186] [2020-02-10 19:50:12,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:13,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 19:50:13,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349233186] [2020-02-10 19:50:13,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:13,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:13,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818605016] [2020-02-10 19:50:13,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:13,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:13,008 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:50:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:13,140 INFO L93 Difference]: Finished difference Result 1471 states and 5096 transitions. [2020-02-10 19:50:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:13,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:13,144 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 19:50:13,144 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 19:50:13,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 19:50:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 802. [2020-02-10 19:50:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:50:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3163 transitions. [2020-02-10 19:50:13,167 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3163 transitions. Word has length 25 [2020-02-10 19:50:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,167 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3163 transitions. [2020-02-10 19:50:13,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3163 transitions. [2020-02-10 19:50:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:13,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:13,168 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2086774157, now seen corresponding path program 676 times [2020-02-10 19:50:13,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131143280] [2020-02-10 19:50:13,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:13,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131143280] [2020-02-10 19:50:13,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:13,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:13,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493010991] [2020-02-10 19:50:13,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:13,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:13,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:13,565 INFO L87 Difference]: Start difference. First operand 802 states and 3163 transitions. Second operand 10 states. [2020-02-10 19:50:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:13,705 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-02-10 19:50:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:13,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:13,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:13,709 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 19:50:13,709 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 19:50:13,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 19:50:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 797. [2020-02-10 19:50:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:50:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3149 transitions. [2020-02-10 19:50:13,733 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3149 transitions. Word has length 25 [2020-02-10 19:50:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,733 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3149 transitions. [2020-02-10 19:50:13,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3149 transitions. [2020-02-10 19:50:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:13,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:13,734 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1691343769, now seen corresponding path program 677 times [2020-02-10 19:50:13,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369185578] [2020-02-10 19:50:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:14,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369185578] [2020-02-10 19:50:14,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:14,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:14,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081246758] [2020-02-10 19:50:14,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:14,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:14,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:14,115 INFO L87 Difference]: Start difference. First operand 797 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:50:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:14,238 INFO L93 Difference]: Finished difference Result 1473 states and 5095 transitions. [2020-02-10 19:50:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:14,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:14,242 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 19:50:14,242 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 19:50:14,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 19:50:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 802. [2020-02-10 19:50:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:50:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3158 transitions. [2020-02-10 19:50:14,265 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3158 transitions. Word has length 25 [2020-02-10 19:50:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:14,265 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3158 transitions. [2020-02-10 19:50:14,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3158 transitions. [2020-02-10 19:50:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:14,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:14,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:14,266 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -992682569, now seen corresponding path program 678 times [2020-02-10 19:50:14,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:14,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673777902] [2020-02-10 19:50:14,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:14,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673777902] [2020-02-10 19:50:14,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:14,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:14,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351738201] [2020-02-10 19:50:14,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:14,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:14,648 INFO L87 Difference]: Start difference. First operand 802 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:50:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:14,769 INFO L93 Difference]: Finished difference Result 1471 states and 5086 transitions. [2020-02-10 19:50:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:14,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:14,773 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 19:50:14,773 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 19:50:14,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 19:50:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 792. [2020-02-10 19:50:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:50:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3135 transitions. [2020-02-10 19:50:14,796 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3135 transitions. Word has length 25 [2020-02-10 19:50:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:14,796 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3135 transitions. [2020-02-10 19:50:14,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3135 transitions. [2020-02-10 19:50:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:14,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:14,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:14,797 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash 901842197, now seen corresponding path program 679 times [2020-02-10 19:50:14,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:14,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494995228] [2020-02-10 19:50:14,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:15,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 19:50:15,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494995228] [2020-02-10 19:50:15,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:15,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:15,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68625060] [2020-02-10 19:50:15,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:15,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:15,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:15,181 INFO L87 Difference]: Start difference. First operand 792 states and 3135 transitions. Second operand 10 states. [2020-02-10 19:50:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:15,325 INFO L93 Difference]: Finished difference Result 1488 states and 5134 transitions. [2020-02-10 19:50:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:15,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:15,328 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 19:50:15,328 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 19:50:15,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 19:50:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 807. [2020-02-10 19:50:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 19:50:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3175 transitions. [2020-02-10 19:50:15,351 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3175 transitions. Word has length 25 [2020-02-10 19:50:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:15,351 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3175 transitions. [2020-02-10 19:50:15,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3175 transitions. [2020-02-10 19:50:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:15,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:15,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:15,353 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash -171243183, now seen corresponding path program 680 times [2020-02-10 19:50:15,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:15,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105767419] [2020-02-10 19:50:15,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:15,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105767419] [2020-02-10 19:50:15,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:15,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:15,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895192184] [2020-02-10 19:50:15,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:15,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:15,742 INFO L87 Difference]: Start difference. First operand 807 states and 3175 transitions. Second operand 10 states. [2020-02-10 19:50:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:15,864 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-02-10 19:50:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:15,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:15,868 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 19:50:15,868 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 19:50:15,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 19:50:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 801. [2020-02-10 19:50:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:50:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3158 transitions. [2020-02-10 19:50:15,890 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3158 transitions. Word has length 25 [2020-02-10 19:50:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:15,890 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3158 transitions. [2020-02-10 19:50:15,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3158 transitions. [2020-02-10 19:50:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:15,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:15,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:15,892 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1995933785, now seen corresponding path program 681 times [2020-02-10 19:50:15,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:15,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518310963] [2020-02-10 19:50:15,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:16,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518310963] [2020-02-10 19:50:16,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:16,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:16,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780864137] [2020-02-10 19:50:16,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:16,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:16,292 INFO L87 Difference]: Start difference. First operand 801 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:50:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:16,412 INFO L93 Difference]: Finished difference Result 1491 states and 5133 transitions. [2020-02-10 19:50:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:16,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:16,416 INFO L225 Difference]: With dead ends: 1491 [2020-02-10 19:50:16,416 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 19:50:16,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 19:50:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 808. [2020-02-10 19:50:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 19:50:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3171 transitions. [2020-02-10 19:50:16,439 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3171 transitions. Word has length 25 [2020-02-10 19:50:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:16,439 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3171 transitions. [2020-02-10 19:50:16,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3171 transitions. [2020-02-10 19:50:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:16,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:16,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:16,441 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash -150236975, now seen corresponding path program 682 times [2020-02-10 19:50:16,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:16,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532106509] [2020-02-10 19:50:16,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:16,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 19:50:16,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532106509] [2020-02-10 19:50:16,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:16,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:16,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417684735] [2020-02-10 19:50:16,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:16,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:16,841 INFO L87 Difference]: Start difference. First operand 808 states and 3171 transitions. Second operand 10 states. [2020-02-10 19:50:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:16,941 INFO L93 Difference]: Finished difference Result 1494 states and 5132 transitions. [2020-02-10 19:50:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:16,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:16,944 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 19:50:16,945 INFO L226 Difference]: Without dead ends: 1469 [2020-02-10 19:50:16,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-02-10 19:50:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 801. [2020-02-10 19:50:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:50:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-02-10 19:50:16,967 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-02-10 19:50:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:16,967 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-02-10 19:50:16,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-02-10 19:50:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:16,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:16,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:16,968 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2016939993, now seen corresponding path program 683 times [2020-02-10 19:50:16,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:16,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389581022] [2020-02-10 19:50:16,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:17,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 19:50:17,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389581022] [2020-02-10 19:50:17,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:17,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:17,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540630825] [2020-02-10 19:50:17,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:17,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:17,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:17,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:17,386 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-02-10 19:50:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:17,503 INFO L93 Difference]: Finished difference Result 1495 states and 5134 transitions. [2020-02-10 19:50:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:17,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:17,507 INFO L225 Difference]: With dead ends: 1495 [2020-02-10 19:50:17,507 INFO L226 Difference]: Without dead ends: 1479 [2020-02-10 19:50:17,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2020-02-10 19:50:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 810. [2020-02-10 19:50:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 19:50:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-02-10 19:50:17,531 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-02-10 19:50:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:17,531 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-02-10 19:50:17,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-02-10 19:50:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:17,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:17,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] [2020-02-10 19:50:17,532 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 943854613, now seen corresponding path program 684 times [2020-02-10 19:50:17,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:17,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596309310] [2020-02-10 19:50:17,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:17,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 19:50:17,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596309310] [2020-02-10 19:50:17,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:17,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:17,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298754364] [2020-02-10 19:50:17,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:17,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:17,934 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-02-10 19:50:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:18,035 INFO L93 Difference]: Finished difference Result 1497 states and 5130 transitions. [2020-02-10 19:50:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:18,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:18,039 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 19:50:18,039 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 19:50:18,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 19:50:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 792. [2020-02-10 19:50:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:50:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3127 transitions. [2020-02-10 19:50:18,061 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3127 transitions. Word has length 25 [2020-02-10 19:50:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:18,061 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3127 transitions. [2020-02-10 19:50:18,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3127 transitions. [2020-02-10 19:50:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:18,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:18,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:18,062 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1227438421, now seen corresponding path program 685 times [2020-02-10 19:50:18,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:18,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339217329] [2020-02-10 19:50:18,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:18,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339217329] [2020-02-10 19:50:18,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:18,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:18,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552281750] [2020-02-10 19:50:18,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:18,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:18,448 INFO L87 Difference]: Start difference. First operand 792 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:50:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:18,569 INFO L93 Difference]: Finished difference Result 1476 states and 5098 transitions. [2020-02-10 19:50:18,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:18,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:18,573 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 19:50:18,573 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 19:50:18,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 19:50:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 803. [2020-02-10 19:50:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 19:50:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3158 transitions. [2020-02-10 19:50:18,596 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3158 transitions. Word has length 25 [2020-02-10 19:50:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:18,596 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3158 transitions. [2020-02-10 19:50:18,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3158 transitions. [2020-02-10 19:50:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:18,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:18,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:18,597 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1765293999, now seen corresponding path program 686 times [2020-02-10 19:50:18,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:18,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393695014] [2020-02-10 19:50:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:18,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393695014] [2020-02-10 19:50:18,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:18,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:18,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220442026] [2020-02-10 19:50:18,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:18,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:18,993 INFO L87 Difference]: Start difference. First operand 803 states and 3158 transitions. Second operand 10 states. [2020-02-10 19:50:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:19,114 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-02-10 19:50:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:19,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:19,118 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 19:50:19,119 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 19:50:19,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 19:50:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 798. [2020-02-10 19:50:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:50:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-02-10 19:50:19,141 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-02-10 19:50:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:19,141 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-02-10 19:50:19,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-02-10 19:50:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:19,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:19,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:19,143 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -372999433, now seen corresponding path program 687 times [2020-02-10 19:50:19,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:19,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560149497] [2020-02-10 19:50:19,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:19,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560149497] [2020-02-10 19:50:19,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:19,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:19,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448873421] [2020-02-10 19:50:19,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:19,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:19,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:19,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:19,541 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:50:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:19,665 INFO L93 Difference]: Finished difference Result 1482 states and 5105 transitions. [2020-02-10 19:50:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:19,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:19,669 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 19:50:19,669 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 19:50:19,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 19:50:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 805. [2020-02-10 19:50:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 19:50:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3157 transitions. [2020-02-10 19:50:19,691 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3157 transitions. Word has length 25 [2020-02-10 19:50:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:19,691 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3157 transitions. [2020-02-10 19:50:19,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3157 transitions. [2020-02-10 19:50:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:19,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:19,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:19,692 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:19,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1775797103, now seen corresponding path program 688 times [2020-02-10 19:50:19,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:19,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374890624] [2020-02-10 19:50:19,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:20,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374890624] [2020-02-10 19:50:20,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:20,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:20,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52744895] [2020-02-10 19:50:20,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:20,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:20,080 INFO L87 Difference]: Start difference. First operand 805 states and 3157 transitions. Second operand 10 states. [2020-02-10 19:50:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,182 INFO L93 Difference]: Finished difference Result 1485 states and 5104 transitions. [2020-02-10 19:50:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:20,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,186 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 19:50:20,186 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 19:50:20,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 19:50:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 798. [2020-02-10 19:50:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:50:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3138 transitions. [2020-02-10 19:50:20,209 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3138 transitions. Word has length 25 [2020-02-10 19:50:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:20,209 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3138 transitions. [2020-02-10 19:50:20,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3138 transitions. [2020-02-10 19:50:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:20,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:20,210 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:20,210 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash -341490121, now seen corresponding path program 689 times [2020-02-10 19:50:20,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:20,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557905245] [2020-02-10 19:50:20,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:20,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557905245] [2020-02-10 19:50:20,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:20,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:20,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996284614] [2020-02-10 19:50:20,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:20,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:20,591 INFO L87 Difference]: Start difference. First operand 798 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:50:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,715 INFO L93 Difference]: Finished difference Result 1479 states and 5092 transitions. [2020-02-10 19:50:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:20,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,719 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 19:50:20,719 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 19:50:20,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 19:50:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 804. [2020-02-10 19:50:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:50:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3149 transitions. [2020-02-10 19:50:20,743 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3149 transitions. Word has length 25 [2020-02-10 19:50:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:20,743 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3149 transitions. [2020-02-10 19:50:20,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3149 transitions. [2020-02-10 19:50:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:20,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:20,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:20,744 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1269450837, now seen corresponding path program 690 times [2020-02-10 19:50:20,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:20,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640790402] [2020-02-10 19:50:20,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:21,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 19:50:21,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640790402] [2020-02-10 19:50:21,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:21,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388320127] [2020-02-10 19:50:21,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:21,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:21,151 INFO L87 Difference]: Start difference. First operand 804 states and 3149 transitions. Second operand 10 states. [2020-02-10 19:50:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:21,250 INFO L93 Difference]: Finished difference Result 1483 states and 5094 transitions. [2020-02-10 19:50:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:21,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:21,253 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 19:50:21,253 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 19:50:21,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 19:50:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-02-10 19:50:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:50:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3121 transitions. [2020-02-10 19:50:21,275 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3121 transitions. Word has length 25 [2020-02-10 19:50:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:21,276 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3121 transitions. [2020-02-10 19:50:21,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3121 transitions. [2020-02-10 19:50:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:21,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:21,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:21,277 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 805545489, now seen corresponding path program 691 times [2020-02-10 19:50:21,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:21,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187132698] [2020-02-10 19:50:21,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:21,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187132698] [2020-02-10 19:50:21,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:21,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:21,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216967830] [2020-02-10 19:50:21,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:21,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:21,659 INFO L87 Difference]: Start difference. First operand 792 states and 3121 transitions. Second operand 10 states. [2020-02-10 19:50:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:21,797 INFO L93 Difference]: Finished difference Result 1482 states and 5104 transitions. [2020-02-10 19:50:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:21,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:21,801 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 19:50:21,801 INFO L226 Difference]: Without dead ends: 1466 [2020-02-10 19:50:21,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-02-10 19:50:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 804. [2020-02-10 19:50:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:50:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3154 transitions. [2020-02-10 19:50:21,824 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3154 transitions. Word has length 25 [2020-02-10 19:50:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:21,824 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3154 transitions. [2020-02-10 19:50:21,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3154 transitions. [2020-02-10 19:50:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:21,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:21,825 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:21,826 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:21,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1878480849, now seen corresponding path program 692 times [2020-02-10 19:50:21,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:21,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340000955] [2020-02-10 19:50:21,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:22,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 19:50:22,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340000955] [2020-02-10 19:50:22,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:22,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:22,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478697556] [2020-02-10 19:50:22,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:22,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:22,208 INFO L87 Difference]: Start difference. First operand 804 states and 3154 transitions. Second operand 10 states. [2020-02-10 19:50:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:22,337 INFO L93 Difference]: Finished difference Result 1480 states and 5095 transitions. [2020-02-10 19:50:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:22,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:22,341 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 19:50:22,341 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 19:50:22,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 19:50:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 799. [2020-02-10 19:50:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:50:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3140 transitions. [2020-02-10 19:50:22,363 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3140 transitions. Word has length 25 [2020-02-10 19:50:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:22,363 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3140 transitions. [2020-02-10 19:50:22,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3140 transitions. [2020-02-10 19:50:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:22,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:22,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:22,364 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash -794892365, now seen corresponding path program 693 times [2020-02-10 19:50:22,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:22,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537226487] [2020-02-10 19:50:22,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:22,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537226487] [2020-02-10 19:50:22,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:22,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:22,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144406175] [2020-02-10 19:50:22,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:22,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:22,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:22,772 INFO L87 Difference]: Start difference. First operand 799 states and 3140 transitions. Second operand 10 states. [2020-02-10 19:50:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:22,918 INFO L93 Difference]: Finished difference Result 1490 states and 5115 transitions. [2020-02-10 19:50:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:22,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:22,922 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 19:50:22,922 INFO L226 Difference]: Without dead ends: 1474 [2020-02-10 19:50:22,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-02-10 19:50:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 808. [2020-02-10 19:50:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 19:50:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3156 transitions. [2020-02-10 19:50:22,944 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3156 transitions. Word has length 25 [2020-02-10 19:50:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:22,945 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3156 transitions. [2020-02-10 19:50:22,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3156 transitions. [2020-02-10 19:50:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:22,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:22,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:22,946 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1867977745, now seen corresponding path program 694 times [2020-02-10 19:50:22,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:22,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951979770] [2020-02-10 19:50:22,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:23,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951979770] [2020-02-10 19:50:23,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:23,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12500228] [2020-02-10 19:50:23,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:23,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:23,344 INFO L87 Difference]: Start difference. First operand 808 states and 3156 transitions. Second operand 10 states. [2020-02-10 19:50:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:23,449 INFO L93 Difference]: Finished difference Result 1492 states and 5111 transitions. [2020-02-10 19:50:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:23,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:23,453 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 19:50:23,453 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 19:50:23,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 19:50:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 799. [2020-02-10 19:50:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 19:50:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3133 transitions. [2020-02-10 19:50:23,476 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3133 transitions. Word has length 25 [2020-02-10 19:50:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:23,476 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3133 transitions. [2020-02-10 19:50:23,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3133 transitions. [2020-02-10 19:50:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:23,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:23,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:23,477 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash -784389261, now seen corresponding path program 695 times [2020-02-10 19:50:23,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:23,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108885605] [2020-02-10 19:50:23,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:23,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108885605] [2020-02-10 19:50:23,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:23,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962260172] [2020-02-10 19:50:23,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:23,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:23,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:23,862 INFO L87 Difference]: Start difference. First operand 799 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:50:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:23,988 INFO L93 Difference]: Finished difference Result 1483 states and 5093 transitions. [2020-02-10 19:50:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:23,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:23,991 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 19:50:23,992 INFO L226 Difference]: Without dead ends: 1469 [2020-02-10 19:50:23,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-02-10 19:50:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 805. [2020-02-10 19:50:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 19:50:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3144 transitions. [2020-02-10 19:50:24,014 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3144 transitions. Word has length 25 [2020-02-10 19:50:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:24,014 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3144 transitions. [2020-02-10 19:50:24,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3144 transitions. [2020-02-10 19:50:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:24,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:24,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:24,016 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 826551697, now seen corresponding path program 696 times [2020-02-10 19:50:24,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:24,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227257749] [2020-02-10 19:50:24,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:24,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227257749] [2020-02-10 19:50:24,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:24,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:24,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616213412] [2020-02-10 19:50:24,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:24,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:24,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:24,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:24,416 INFO L87 Difference]: Start difference. First operand 805 states and 3144 transitions. Second operand 10 states. [2020-02-10 19:50:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:24,530 INFO L93 Difference]: Finished difference Result 1487 states and 5095 transitions. [2020-02-10 19:50:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:24,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:24,534 INFO L225 Difference]: With dead ends: 1487 [2020-02-10 19:50:24,534 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 19:50:24,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 19:50:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 783. [2020-02-10 19:50:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:50:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3099 transitions. [2020-02-10 19:50:24,556 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3099 transitions. Word has length 25 [2020-02-10 19:50:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:24,556 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3099 transitions. [2020-02-10 19:50:24,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3099 transitions. [2020-02-10 19:50:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:24,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:24,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:24,557 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 489859575, now seen corresponding path program 697 times [2020-02-10 19:50:24,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:24,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439722646] [2020-02-10 19:50:24,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:24,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 19:50:24,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439722646] [2020-02-10 19:50:24,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:24,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:24,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636265753] [2020-02-10 19:50:24,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:24,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:24,914 INFO L87 Difference]: Start difference. First operand 783 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:50:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:25,042 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-02-10 19:50:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:25,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:25,046 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:50:25,046 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 19:50:25,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 19:50:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-02-10 19:50:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:50:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-02-10 19:50:25,070 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-02-10 19:50:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:25,070 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-02-10 19:50:25,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-02-10 19:50:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:25,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:25,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:25,071 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2100800533, now seen corresponding path program 698 times [2020-02-10 19:50:25,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:25,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118480978] [2020-02-10 19:50:25,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:25,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 19:50:25,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118480978] [2020-02-10 19:50:25,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:25,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:25,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129270952] [2020-02-10 19:50:25,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:25,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:25,436 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-02-10 19:50:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:25,566 INFO L93 Difference]: Finished difference Result 1436 states and 4984 transitions. [2020-02-10 19:50:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:25,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:25,570 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 19:50:25,570 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 19:50:25,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 19:50:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-02-10 19:50:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:50:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-02-10 19:50:25,592 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-02-10 19:50:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:25,592 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-02-10 19:50:25,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-02-10 19:50:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:25,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:25,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:25,593 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1110578279, now seen corresponding path program 699 times [2020-02-10 19:50:25,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:25,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635307625] [2020-02-10 19:50:25,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:25,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 19:50:25,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635307625] [2020-02-10 19:50:25,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:25,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:25,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546073681] [2020-02-10 19:50:25,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:25,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:25,954 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-02-10 19:50:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:26,086 INFO L93 Difference]: Finished difference Result 1430 states and 4972 transitions. [2020-02-10 19:50:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:26,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:26,090 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 19:50:26,090 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 19:50:26,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 19:50:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-02-10 19:50:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 19:50:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-02-10 19:50:26,125 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-02-10 19:50:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:26,125 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-02-10 19:50:26,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-02-10 19:50:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:26,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:26,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:26,126 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2111303637, now seen corresponding path program 700 times [2020-02-10 19:50:26,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:26,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402988027] [2020-02-10 19:50:26,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:26,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402988027] [2020-02-10 19:50:26,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:26,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:26,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180800793] [2020-02-10 19:50:26,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:26,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:26,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:26,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:26,494 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-02-10 19:50:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:26,623 INFO L93 Difference]: Finished difference Result 1432 states and 4973 transitions. [2020-02-10 19:50:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:26,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:26,626 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 19:50:26,626 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 19:50:26,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 19:50:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-02-10 19:50:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 19:50:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3125 transitions. [2020-02-10 19:50:26,649 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3125 transitions. Word has length 25 [2020-02-10 19:50:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:26,649 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3125 transitions. [2020-02-10 19:50:26,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3125 transitions. [2020-02-10 19:50:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:26,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:26,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] [2020-02-10 19:50:26,650 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1100075175, now seen corresponding path program 701 times [2020-02-10 19:50:26,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:26,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804400875] [2020-02-10 19:50:26,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:27,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804400875] [2020-02-10 19:50:27,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:27,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:27,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387361659] [2020-02-10 19:50:27,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:27,017 INFO L87 Difference]: Start difference. First operand 791 states and 3125 transitions. Second operand 10 states. [2020-02-10 19:50:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:27,143 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-02-10 19:50:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:27,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:27,146 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:50:27,147 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:50:27,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:50:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 796. [2020-02-10 19:50:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:50:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3134 transitions. [2020-02-10 19:50:27,169 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3134 transitions. Word has length 25 [2020-02-10 19:50:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:27,169 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3134 transitions. [2020-02-10 19:50:27,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3134 transitions. [2020-02-10 19:50:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:27,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:27,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:27,171 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash 510865783, now seen corresponding path program 702 times [2020-02-10 19:50:27,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:27,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232482112] [2020-02-10 19:50:27,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:27,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232482112] [2020-02-10 19:50:27,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:27,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:27,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183264572] [2020-02-10 19:50:27,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:27,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:27,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:27,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:27,530 INFO L87 Difference]: Start difference. First operand 796 states and 3134 transitions. Second operand 10 states. [2020-02-10 19:50:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:27,677 INFO L93 Difference]: Finished difference Result 1438 states and 4982 transitions. [2020-02-10 19:50:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:27,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:27,681 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 19:50:27,681 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 19:50:27,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 19:50:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 788. [2020-02-10 19:50:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:50:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3117 transitions. [2020-02-10 19:50:27,704 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3117 transitions. Word has length 25 [2020-02-10 19:50:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:27,704 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3117 transitions. [2020-02-10 19:50:27,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3117 transitions. [2020-02-10 19:50:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:27,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:27,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:27,705 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1879073643, now seen corresponding path program 703 times [2020-02-10 19:50:27,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:27,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559697469] [2020-02-10 19:50:27,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:28,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559697469] [2020-02-10 19:50:28,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:28,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:28,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109122288] [2020-02-10 19:50:28,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:28,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:28,079 INFO L87 Difference]: Start difference. First operand 788 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:50:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:28,228 INFO L93 Difference]: Finished difference Result 1443 states and 4999 transitions. [2020-02-10 19:50:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:28,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:28,232 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 19:50:28,232 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 19:50:28,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 19:50:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 796. [2020-02-10 19:50:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:50:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3138 transitions. [2020-02-10 19:50:28,255 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3138 transitions. Word has length 25 [2020-02-10 19:50:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:28,255 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3138 transitions. [2020-02-10 19:50:28,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3138 transitions. [2020-02-10 19:50:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:28,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:28,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:28,257 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash -268132685, now seen corresponding path program 704 times [2020-02-10 19:50:28,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:28,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844893757] [2020-02-10 19:50:28,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:28,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844893757] [2020-02-10 19:50:28,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:28,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:28,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949146175] [2020-02-10 19:50:28,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:28,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:28,620 INFO L87 Difference]: Start difference. First operand 796 states and 3138 transitions. Second operand 10 states. [2020-02-10 19:50:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:28,751 INFO L93 Difference]: Finished difference Result 1447 states and 5004 transitions. [2020-02-10 19:50:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:28,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:28,755 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 19:50:28,755 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:50:28,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:50:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-02-10 19:50:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:50:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-02-10 19:50:28,778 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-02-10 19:50:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:28,778 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-02-10 19:50:28,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-02-10 19:50:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:28,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:28,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:28,779 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash -784982055, now seen corresponding path program 705 times [2020-02-10 19:50:28,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:28,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434876845] [2020-02-10 19:50:28,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:29,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 19:50:29,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434876845] [2020-02-10 19:50:29,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:29,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:29,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798889552] [2020-02-10 19:50:29,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:29,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:29,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:29,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:29,141 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:50:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:29,269 INFO L93 Difference]: Finished difference Result 1446 states and 5001 transitions. [2020-02-10 19:50:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:29,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:29,273 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:50:29,273 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 19:50:29,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 19:50:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 19:50:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 19:50:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3137 transitions. [2020-02-10 19:50:29,314 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3137 transitions. Word has length 25 [2020-02-10 19:50:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:29,314 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3137 transitions. [2020-02-10 19:50:29,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3137 transitions. [2020-02-10 19:50:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:29,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:29,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:29,316 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -247126477, now seen corresponding path program 706 times [2020-02-10 19:50:29,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:29,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736565912] [2020-02-10 19:50:29,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:29,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736565912] [2020-02-10 19:50:29,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:29,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:29,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771014599] [2020-02-10 19:50:29,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:29,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:29,690 INFO L87 Difference]: Start difference. First operand 797 states and 3137 transitions. Second operand 10 states. [2020-02-10 19:50:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:29,797 INFO L93 Difference]: Finished difference Result 1452 states and 5009 transitions. [2020-02-10 19:50:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:29,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:29,800 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 19:50:29,800 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 19:50:29,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 19:50:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 19:50:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 19:50:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3126 transitions. [2020-02-10 19:50:29,822 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3126 transitions. Word has length 25 [2020-02-10 19:50:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:29,822 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3126 transitions. [2020-02-10 19:50:29,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3126 transitions. [2020-02-10 19:50:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:29,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:29,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:29,823 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -774478951, now seen corresponding path program 707 times [2020-02-10 19:50:29,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:29,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695109973] [2020-02-10 19:50:29,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:30,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695109973] [2020-02-10 19:50:30,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:30,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:30,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008498630] [2020-02-10 19:50:30,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:30,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:30,205 INFO L87 Difference]: Start difference. First operand 793 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:50:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:30,334 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-02-10 19:50:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:30,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:30,338 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 19:50:30,338 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 19:50:30,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 19:50:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 802. [2020-02-10 19:50:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 19:50:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3142 transitions. [2020-02-10 19:50:30,360 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3142 transitions. Word has length 25 [2020-02-10 19:50:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,360 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3142 transitions. [2020-02-10 19:50:30,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3142 transitions. [2020-02-10 19:50:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:30,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:30,362 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1847564331, now seen corresponding path program 708 times [2020-02-10 19:50:30,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444073004] [2020-02-10 19:50:30,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:30,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444073004] [2020-02-10 19:50:30,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:30,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:30,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70444755] [2020-02-10 19:50:30,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:30,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:30,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:30,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:30,746 INFO L87 Difference]: Start difference. First operand 802 states and 3142 transitions. Second operand 10 states. [2020-02-10 19:50:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:30,851 INFO L93 Difference]: Finished difference Result 1461 states and 5022 transitions. [2020-02-10 19:50:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:30,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:30,855 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 19:50:30,855 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 19:50:30,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 19:50:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 788. [2020-02-10 19:50:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:50:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3112 transitions. [2020-02-10 19:50:30,878 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3112 transitions. Word has length 25 [2020-02-10 19:50:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,879 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3112 transitions. [2020-02-10 19:50:30,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3112 transitions. [2020-02-10 19:50:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:30,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:30,880 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1553477419, now seen corresponding path program 709 times [2020-02-10 19:50:30,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185125725] [2020-02-10 19:50:30,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:31,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185125725] [2020-02-10 19:50:31,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:31,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:31,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465022494] [2020-02-10 19:50:31,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:31,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:31,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:31,265 INFO L87 Difference]: Start difference. First operand 788 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:50:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:31,414 INFO L93 Difference]: Finished difference Result 1435 states and 4977 transitions. [2020-02-10 19:50:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:31,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:31,418 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 19:50:31,418 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 19:50:31,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 19:50:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 795. [2020-02-10 19:50:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:50:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3131 transitions. [2020-02-10 19:50:31,440 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3131 transitions. Word has length 25 [2020-02-10 19:50:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:31,440 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3131 transitions. [2020-02-10 19:50:31,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3131 transitions. [2020-02-10 19:50:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:31,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:31,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] [2020-02-10 19:50:31,442 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1668404497, now seen corresponding path program 710 times [2020-02-10 19:50:31,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:31,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241904680] [2020-02-10 19:50:31,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:31,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241904680] [2020-02-10 19:50:31,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:31,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:31,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150644241] [2020-02-10 19:50:31,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:31,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:31,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:31,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:31,801 INFO L87 Difference]: Start difference. First operand 795 states and 3131 transitions. Second operand 10 states. [2020-02-10 19:50:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:31,926 INFO L93 Difference]: Finished difference Result 1437 states and 4978 transitions. [2020-02-10 19:50:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:31,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:31,930 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 19:50:31,930 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 19:50:31,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 19:50:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 792. [2020-02-10 19:50:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:50:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3123 transitions. [2020-02-10 19:50:31,953 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3123 transitions. Word has length 25 [2020-02-10 19:50:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:31,953 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3123 transitions. [2020-02-10 19:50:31,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3123 transitions. [2020-02-10 19:50:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:31,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:31,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:31,954 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:31,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:31,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1141052023, now seen corresponding path program 711 times [2020-02-10 19:50:31,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:31,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549632989] [2020-02-10 19:50:31,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:32,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549632989] [2020-02-10 19:50:32,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:32,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:32,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353189618] [2020-02-10 19:50:32,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:32,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:32,325 INFO L87 Difference]: Start difference. First operand 792 states and 3123 transitions. Second operand 10 states. [2020-02-10 19:50:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:32,454 INFO L93 Difference]: Finished difference Result 1440 states and 4983 transitions. [2020-02-10 19:50:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:32,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:32,458 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 19:50:32,458 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 19:50:32,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 19:50:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 796. [2020-02-10 19:50:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 19:50:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3130 transitions. [2020-02-10 19:50:32,480 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3130 transitions. Word has length 25 [2020-02-10 19:50:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:32,480 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3130 transitions. [2020-02-10 19:50:32,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3130 transitions. [2020-02-10 19:50:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:32,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:32,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:32,482 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1678907601, now seen corresponding path program 712 times [2020-02-10 19:50:32,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:32,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737913435] [2020-02-10 19:50:32,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:32,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737913435] [2020-02-10 19:50:32,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:32,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:32,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984987670] [2020-02-10 19:50:32,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:32,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:32,866 INFO L87 Difference]: Start difference. First operand 796 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:50:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:32,971 INFO L93 Difference]: Finished difference Result 1446 states and 4991 transitions. [2020-02-10 19:50:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:32,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:32,974 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:50:32,974 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 19:50:32,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 19:50:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-02-10 19:50:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 19:50:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3119 transitions. [2020-02-10 19:50:32,997 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3119 transitions. Word has length 25 [2020-02-10 19:50:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:32,997 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3119 transitions. [2020-02-10 19:50:32,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3119 transitions. [2020-02-10 19:50:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:32,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:32,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:32,999 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1162058231, now seen corresponding path program 713 times [2020-02-10 19:50:32,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:32,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374640214] [2020-02-10 19:50:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:33,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374640214] [2020-02-10 19:50:33,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:33,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:33,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721208746] [2020-02-10 19:50:33,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:33,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:33,378 INFO L87 Difference]: Start difference. First operand 792 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:50:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:33,506 INFO L93 Difference]: Finished difference Result 1446 states and 4993 transitions. [2020-02-10 19:50:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:33,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:33,509 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 19:50:33,510 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 19:50:33,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 19:50:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-02-10 19:50:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 19:50:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3130 transitions. [2020-02-10 19:50:33,532 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3130 transitions. Word has length 25 [2020-02-10 19:50:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:33,533 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3130 transitions. [2020-02-10 19:50:33,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3130 transitions. [2020-02-10 19:50:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:33,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:33,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:33,534 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:33,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1521968107, now seen corresponding path program 714 times [2020-02-10 19:50:33,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:33,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710268353] [2020-02-10 19:50:33,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:33,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710268353] [2020-02-10 19:50:33,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:33,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:33,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518741514] [2020-02-10 19:50:33,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:33,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:33,918 INFO L87 Difference]: Start difference. First operand 798 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:50:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,028 INFO L93 Difference]: Finished difference Result 1450 states and 4995 transitions. [2020-02-10 19:50:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:34,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,032 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 19:50:34,032 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 19:50:34,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 19:50:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 788. [2020-02-10 19:50:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 19:50:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3108 transitions. [2020-02-10 19:50:34,055 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3108 transitions. Word has length 25 [2020-02-10 19:50:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:34,055 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3108 transitions. [2020-02-10 19:50:34,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3108 transitions. [2020-02-10 19:50:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:34,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:34,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:34,056 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 383059763, now seen corresponding path program 715 times [2020-02-10 19:50:34,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:34,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016187804] [2020-02-10 19:50:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:34,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 19:50:34,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016187804] [2020-02-10 19:50:34,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:34,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:34,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585252482] [2020-02-10 19:50:34,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:34,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:34,442 INFO L87 Difference]: Start difference. First operand 788 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:50:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,569 INFO L93 Difference]: Finished difference Result 1459 states and 5032 transitions. [2020-02-10 19:50:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:34,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,573 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 19:50:34,573 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 19:50:34,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 19:50:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 800. [2020-02-10 19:50:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 19:50:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-02-10 19:50:34,595 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-02-10 19:50:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:34,595 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-02-10 19:50:34,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-02-10 19:50:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:34,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:34,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:34,597 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1994000721, now seen corresponding path program 716 times [2020-02-10 19:50:34,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:34,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149046599] [2020-02-10 19:50:34,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:34,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149046599] [2020-02-10 19:50:34,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:34,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:34,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890222432] [2020-02-10 19:50:34,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:34,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:34,967 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-02-10 19:50:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:35,094 INFO L93 Difference]: Finished difference Result 1457 states and 5023 transitions. [2020-02-10 19:50:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:35,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:35,097 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 19:50:35,097 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 19:50:35,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 19:50:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 795. [2020-02-10 19:50:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:50:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3127 transitions. [2020-02-10 19:50:35,120 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3127 transitions. Word has length 25 [2020-02-10 19:50:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:35,120 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3127 transitions. [2020-02-10 19:50:35,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3127 transitions. [2020-02-10 19:50:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:35,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:35,121 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1217378091, now seen corresponding path program 717 times [2020-02-10 19:50:35,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601370396] [2020-02-10 19:50:35,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:35,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601370396] [2020-02-10 19:50:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:35,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283659143] [2020-02-10 19:50:35,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:35,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:35,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:35,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:35,535 INFO L87 Difference]: Start difference. First operand 795 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:50:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:35,665 INFO L93 Difference]: Finished difference Result 1467 states and 5043 transitions. [2020-02-10 19:50:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:35,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:35,669 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 19:50:35,669 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 19:50:35,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 19:50:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-02-10 19:50:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 19:50:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3143 transitions. [2020-02-10 19:50:35,692 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3143 transitions. Word has length 25 [2020-02-10 19:50:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:35,692 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3143 transitions. [2020-02-10 19:50:35,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3143 transitions. [2020-02-10 19:50:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:35,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:35,693 INFO L427 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2004503825, now seen corresponding path program 718 times [2020-02-10 19:50:35,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410691341] [2020-02-10 19:50:35,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:36,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410691341] [2020-02-10 19:50:36,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:36,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:36,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400018945] [2020-02-10 19:50:36,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:36,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:36,097 INFO L87 Difference]: Start difference. First operand 804 states and 3143 transitions. Second operand 10 states. [2020-02-10 19:50:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:36,202 INFO L93 Difference]: Finished difference Result 1469 states and 5039 transitions. [2020-02-10 19:50:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:36,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:36,206 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 19:50:36,206 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 19:50:36,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 19:50:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 795. [2020-02-10 19:50:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 19:50:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3120 transitions. [2020-02-10 19:50:36,228 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3120 transitions. Word has length 25 [2020-02-10 19:50:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:36,228 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3120 transitions. [2020-02-10 19:50:36,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3120 transitions. [2020-02-10 19:50:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:36,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:36,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:36,230 INFO L427 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1206874987, now seen corresponding path program 719 times [2020-02-10 19:50:36,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:36,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551384590] [2020-02-10 19:50:36,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:36,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551384590] [2020-02-10 19:50:36,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:36,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:36,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161875450] [2020-02-10 19:50:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:36,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:36,609 INFO L87 Difference]: Start difference. First operand 795 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:50:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:36,734 INFO L93 Difference]: Finished difference Result 1460 states and 5021 transitions. [2020-02-10 19:50:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:36,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:36,737 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 19:50:36,737 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 19:50:36,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 19:50:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 801. [2020-02-10 19:50:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 19:50:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3131 transitions. [2020-02-10 19:50:36,760 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3131 transitions. Word has length 25 [2020-02-10 19:50:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:36,760 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3131 transitions. [2020-02-10 19:50:36,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3131 transitions. [2020-02-10 19:50:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:36,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:36,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:36,761 INFO L427 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash 404065971, now seen corresponding path program 720 times [2020-02-10 19:50:36,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:36,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839690366] [2020-02-10 19:50:36,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:37,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839690366] [2020-02-10 19:50:37,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:37,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:37,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620625036] [2020-02-10 19:50:37,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:37,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:37,150 INFO L87 Difference]: Start difference. First operand 801 states and 3131 transitions. Second operand 10 states. [2020-02-10 19:50:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:37,262 INFO L93 Difference]: Finished difference Result 1464 states and 5023 transitions. [2020-02-10 19:50:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:37,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:37,266 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 19:50:37,266 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 19:50:37,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 19:50:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 767. [2020-02-10 19:50:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-02-10 19:50:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3065 transitions. [2020-02-10 19:50:37,288 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3065 transitions. Word has length 25 [2020-02-10 19:50:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:37,288 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 3065 transitions. [2020-02-10 19:50:37,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3065 transitions. [2020-02-10 19:50:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:37,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:37,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:37,289 INFO L427 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1154951873, now seen corresponding path program 721 times [2020-02-10 19:50:37,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:37,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159001431] [2020-02-10 19:50:37,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:37,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159001431] [2020-02-10 19:50:37,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:37,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:37,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027628371] [2020-02-10 19:50:37,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:37,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:37,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:37,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:37,643 INFO L87 Difference]: Start difference. First operand 767 states and 3065 transitions. Second operand 10 states. [2020-02-10 19:50:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:37,773 INFO L93 Difference]: Finished difference Result 1241 states and 4395 transitions. [2020-02-10 19:50:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:37,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:37,777 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 19:50:37,777 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:50:37,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:50:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-02-10 19:50:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:50:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 19:50:37,798 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 19:50:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:37,798 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 19:50:37,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 19:50:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:37,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:37,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:37,799 INFO L427 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash -184700259, now seen corresponding path program 722 times [2020-02-10 19:50:37,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:37,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650715531] [2020-02-10 19:50:37,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:38,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 19:50:38,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650715531] [2020-02-10 19:50:38,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:38,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:38,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541762560] [2020-02-10 19:50:38,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:38,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:38,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:38,181 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 19:50:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:38,313 INFO L93 Difference]: Finished difference Result 1243 states and 4395 transitions. [2020-02-10 19:50:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:38,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:38,316 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:50:38,316 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:50:38,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:50:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 19:50:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3117 transitions. [2020-02-10 19:50:38,337 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3117 transitions. Word has length 25 [2020-02-10 19:50:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:38,337 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3117 transitions. [2020-02-10 19:50:38,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3117 transitions. [2020-02-10 19:50:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:38,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:38,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] [2020-02-10 19:50:38,338 INFO L427 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash 771082205, now seen corresponding path program 723 times [2020-02-10 19:50:38,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:38,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944609409] [2020-02-10 19:50:38,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:38,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944609409] [2020-02-10 19:50:38,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:38,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:38,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167783146] [2020-02-10 19:50:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:38,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:38,695 INFO L87 Difference]: Start difference. First operand 778 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:50:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:38,828 INFO L93 Difference]: Finished difference Result 1237 states and 4383 transitions. [2020-02-10 19:50:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:38,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:38,832 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:50:38,832 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:50:38,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:50:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-02-10 19:50:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3122 transitions. [2020-02-10 19:50:38,854 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3122 transitions. Word has length 25 [2020-02-10 19:50:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:38,854 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3122 transitions. [2020-02-10 19:50:38,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3122 transitions. [2020-02-10 19:50:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:38,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:38,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:38,855 INFO L427 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1751836923, now seen corresponding path program 724 times [2020-02-10 19:50:38,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:38,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702310949] [2020-02-10 19:50:38,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:39,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 19:50:39,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702310949] [2020-02-10 19:50:39,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:39,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:39,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880561059] [2020-02-10 19:50:39,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:39,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:39,228 INFO L87 Difference]: Start difference. First operand 781 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:50:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:39,380 INFO L93 Difference]: Finished difference Result 1236 states and 4378 transitions. [2020-02-10 19:50:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:39,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:39,383 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 19:50:39,383 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 19:50:39,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 19:50:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-02-10 19:50:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-02-10 19:50:39,404 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-02-10 19:50:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:39,404 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-02-10 19:50:39,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-02-10 19:50:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:39,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:39,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:39,405 INFO L427 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash 153924927, now seen corresponding path program 725 times [2020-02-10 19:50:39,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:39,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608273435] [2020-02-10 19:50:39,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:39,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608273435] [2020-02-10 19:50:39,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:39,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:39,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106338753] [2020-02-10 19:50:39,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:39,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:39,774 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:50:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:39,900 INFO L93 Difference]: Finished difference Result 1241 states and 4388 transitions. [2020-02-10 19:50:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:39,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:39,904 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 19:50:39,904 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:50:39,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:50:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 19:50:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 19:50:39,925 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 19:50:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:39,926 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 19:50:39,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 19:50:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:39,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:39,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:39,927 INFO L427 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1764865885, now seen corresponding path program 726 times [2020-02-10 19:50:39,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:39,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801169220] [2020-02-10 19:50:39,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:40,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801169220] [2020-02-10 19:50:40,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:40,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:40,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503236837] [2020-02-10 19:50:40,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:40,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:40,292 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:50:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:40,430 INFO L93 Difference]: Finished difference Result 1238 states and 4379 transitions. [2020-02-10 19:50:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:40,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:40,433 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:50:40,434 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:50:40,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:50:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-02-10 19:50:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:50:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3106 transitions. [2020-02-10 19:50:40,455 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3106 transitions. Word has length 25 [2020-02-10 19:50:40,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:40,455 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3106 transitions. [2020-02-10 19:50:40,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3106 transitions. [2020-02-10 19:50:40,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:40,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:40,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:40,456 INFO L427 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:40,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1577437599, now seen corresponding path program 727 times [2020-02-10 19:50:40,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:40,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401982659] [2020-02-10 19:50:40,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:40,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401982659] [2020-02-10 19:50:40,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:40,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:40,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434625318] [2020-02-10 19:50:40,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:40,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:40,821 INFO L87 Difference]: Start difference. First operand 775 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:50:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:40,952 INFO L93 Difference]: Finished difference Result 1250 states and 4416 transitions. [2020-02-10 19:50:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:40,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:40,956 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:50:40,956 INFO L226 Difference]: Without dead ends: 1237 [2020-02-10 19:50:40,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2020-02-10 19:50:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 783. [2020-02-10 19:50:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:50:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3128 transitions. [2020-02-10 19:50:40,977 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3128 transitions. Word has length 25 [2020-02-10 19:50:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:40,978 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3128 transitions. [2020-02-10 19:50:40,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3128 transitions. [2020-02-10 19:50:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:40,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:40,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:40,979 INFO L427 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash -607185985, now seen corresponding path program 728 times [2020-02-10 19:50:40,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:40,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788817166] [2020-02-10 19:50:40,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:41,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788817166] [2020-02-10 19:50:41,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:41,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001450996] [2020-02-10 19:50:41,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:41,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:41,348 INFO L87 Difference]: Start difference. First operand 783 states and 3128 transitions. Second operand 10 states. [2020-02-10 19:50:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:41,508 INFO L93 Difference]: Finished difference Result 1252 states and 4416 transitions. [2020-02-10 19:50:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:41,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:41,511 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 19:50:41,511 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 19:50:41,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 19:50:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 779. [2020-02-10 19:50:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:50:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3117 transitions. [2020-02-10 19:50:41,532 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3117 transitions. Word has length 25 [2020-02-10 19:50:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:41,532 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3117 transitions. [2020-02-10 19:50:41,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3117 transitions. [2020-02-10 19:50:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:41,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:41,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:41,534 INFO L427 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2020336739, now seen corresponding path program 729 times [2020-02-10 19:50:41,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:41,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324182699] [2020-02-10 19:50:41,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:41,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324182699] [2020-02-10 19:50:41,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:41,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985844752] [2020-02-10 19:50:41,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:41,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:41,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:41,908 INFO L87 Difference]: Start difference. First operand 779 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:50:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,041 INFO L93 Difference]: Finished difference Result 1251 states and 4414 transitions. [2020-02-10 19:50:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:42,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,044 INFO L225 Difference]: With dead ends: 1251 [2020-02-10 19:50:42,045 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 19:50:42,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 19:50:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-02-10 19:50:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:50:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-02-10 19:50:42,066 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-02-10 19:50:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,066 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-02-10 19:50:42,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-02-10 19:50:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:42,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:42,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:42,068 INFO L427 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1029078917, now seen corresponding path program 730 times [2020-02-10 19:50:42,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393569212] [2020-02-10 19:50:42,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:42,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393569212] [2020-02-10 19:50:42,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:42,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:42,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623671232] [2020-02-10 19:50:42,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:42,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:42,428 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:50:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,563 INFO L93 Difference]: Finished difference Result 1254 states and 4416 transitions. [2020-02-10 19:50:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:42,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,566 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 19:50:42,566 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 19:50:42,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 19:50:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 779. [2020-02-10 19:50:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:50:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-02-10 19:50:42,587 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-02-10 19:50:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,587 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-02-10 19:50:42,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-02-10 19:50:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:42,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:42,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:42,588 INFO L427 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 57035425, now seen corresponding path program 731 times [2020-02-10 19:50:42,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333113594] [2020-02-10 19:50:42,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:42,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333113594] [2020-02-10 19:50:42,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:42,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:42,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835429570] [2020-02-10 19:50:42,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:42,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:42,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:42,951 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:50:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:43,079 INFO L93 Difference]: Finished difference Result 1257 states and 4424 transitions. [2020-02-10 19:50:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:43,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:43,082 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 19:50:43,082 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:50:43,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:50:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 785. [2020-02-10 19:50:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:50:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3124 transitions. [2020-02-10 19:50:43,103 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3124 transitions. Word has length 25 [2020-02-10 19:50:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:43,104 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3124 transitions. [2020-02-10 19:50:43,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3124 transitions. [2020-02-10 19:50:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:43,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:43,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:43,105 INFO L427 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1016049955, now seen corresponding path program 732 times [2020-02-10 19:50:43,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:43,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517002908] [2020-02-10 19:50:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:43,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 19:50:43,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517002908] [2020-02-10 19:50:43,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:43,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:43,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791288382] [2020-02-10 19:50:43,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:43,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:43,471 INFO L87 Difference]: Start difference. First operand 785 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:50:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:43,611 INFO L93 Difference]: Finished difference Result 1258 states and 4420 transitions. [2020-02-10 19:50:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:43,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:43,615 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 19:50:43,615 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:50:43,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:50:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 775. [2020-02-10 19:50:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:50:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-02-10 19:50:43,636 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-02-10 19:50:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:43,637 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-02-10 19:50:43,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-02-10 19:50:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:43,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:43,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] [2020-02-10 19:50:43,638 INFO L427 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash -73889247, now seen corresponding path program 733 times [2020-02-10 19:50:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:43,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073023719] [2020-02-10 19:50:43,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:44,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073023719] [2020-02-10 19:50:44,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:44,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:44,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903726469] [2020-02-10 19:50:44,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:44,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:44,016 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:50:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:44,141 INFO L93 Difference]: Finished difference Result 1238 states and 4382 transitions. [2020-02-10 19:50:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:44,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:44,145 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:50:44,145 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:50:44,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:50:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-02-10 19:50:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 19:50:44,167 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 19:50:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:44,167 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 19:50:44,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 19:50:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:44,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:44,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:44,168 INFO L427 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 906865471, now seen corresponding path program 734 times [2020-02-10 19:50:44,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:44,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795045385] [2020-02-10 19:50:44,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:44,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795045385] [2020-02-10 19:50:44,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:44,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:44,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643614368] [2020-02-10 19:50:44,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:44,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:44,531 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:50:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:44,672 INFO L93 Difference]: Finished difference Result 1237 states and 4377 transitions. [2020-02-10 19:50:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:44,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:44,676 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:50:44,676 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 19:50:44,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 19:50:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-02-10 19:50:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-02-10 19:50:44,697 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-02-10 19:50:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:44,697 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-02-10 19:50:44,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-02-10 19:50:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:44,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:44,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] [2020-02-10 19:50:44,699 INFO L427 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1852144831, now seen corresponding path program 735 times [2020-02-10 19:50:44,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:44,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379212690] [2020-02-10 19:50:44,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:45,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379212690] [2020-02-10 19:50:45,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:45,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:45,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291409454] [2020-02-10 19:50:45,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:45,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:45,059 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:50:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:45,190 INFO L93 Difference]: Finished difference Result 1243 states and 4390 transitions. [2020-02-10 19:50:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:45,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:45,193 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:50:45,193 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:50:45,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:50:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 782. [2020-02-10 19:50:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:50:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-02-10 19:50:45,215 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-02-10 19:50:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:45,215 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-02-10 19:50:45,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-02-10 19:50:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:45,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:45,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] [2020-02-10 19:50:45,217 INFO L427 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1451564643, now seen corresponding path program 736 times [2020-02-10 19:50:45,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:45,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227399313] [2020-02-10 19:50:45,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:45,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227399313] [2020-02-10 19:50:45,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:45,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:45,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101702354] [2020-02-10 19:50:45,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:45,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:45,578 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-02-10 19:50:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:45,719 INFO L93 Difference]: Finished difference Result 1246 states and 4392 transitions. [2020-02-10 19:50:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:45,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:45,722 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:50:45,723 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:50:45,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:50:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 778. [2020-02-10 19:50:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 19:50:45,758 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 19:50:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:45,758 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 19:50:45,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 19:50:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:45,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:45,759 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:45,759 INFO L427 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:45,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1571086881, now seen corresponding path program 737 times [2020-02-10 19:50:45,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:45,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394370384] [2020-02-10 19:50:45,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:46,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394370384] [2020-02-10 19:50:46,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:46,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:46,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023447200] [2020-02-10 19:50:46,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:46,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:46,118 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:50:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:46,259 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-02-10 19:50:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:46,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:46,263 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:50:46,263 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:50:46,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:50:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-02-10 19:50:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 19:50:46,285 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 19:50:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,285 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 19:50:46,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 19:50:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:46,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:46,286 INFO L427 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1112939457, now seen corresponding path program 738 times [2020-02-10 19:50:46,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410588961] [2020-02-10 19:50:46,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:46,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410588961] [2020-02-10 19:50:46,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:46,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:46,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852618193] [2020-02-10 19:50:46,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:46,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:46,643 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:50:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:46,785 INFO L93 Difference]: Finished difference Result 1244 states and 4385 transitions. [2020-02-10 19:50:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:46,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:46,788 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:50:46,788 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 19:50:46,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 19:50:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 775. [2020-02-10 19:50:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:50:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-02-10 19:50:46,810 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-02-10 19:50:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,810 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-02-10 19:50:46,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-02-10 19:50:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:46,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:46,811 INFO L427 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -730047843, now seen corresponding path program 739 times [2020-02-10 19:50:46,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913568038] [2020-02-10 19:50:46,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:47,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913568038] [2020-02-10 19:50:47,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:47,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:47,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301468396] [2020-02-10 19:50:47,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:47,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:47,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:47,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:47,169 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:50:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:47,305 INFO L93 Difference]: Finished difference Result 1246 states and 4397 transitions. [2020-02-10 19:50:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:47,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:47,308 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:50:47,309 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 19:50:47,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 19:50:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-02-10 19:50:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 19:50:47,331 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 19:50:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:47,331 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 19:50:47,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 19:50:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:47,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:47,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:47,333 INFO L427 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash 880893115, now seen corresponding path program 740 times [2020-02-10 19:50:47,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:47,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395279492] [2020-02-10 19:50:47,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:47,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395279492] [2020-02-10 19:50:47,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:47,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:47,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759860417] [2020-02-10 19:50:47,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:47,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:47,694 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:50:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:47,886 INFO L93 Difference]: Finished difference Result 1243 states and 4388 transitions. [2020-02-10 19:50:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:47,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:47,889 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:50:47,889 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:50:47,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:50:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 778. [2020-02-10 19:50:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 19:50:47,911 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 19:50:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:47,911 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 19:50:47,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 19:50:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:47,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:47,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:47,912 INFO L427 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1964481599, now seen corresponding path program 741 times [2020-02-10 19:50:47,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:47,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332985608] [2020-02-10 19:50:47,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:48,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332985608] [2020-02-10 19:50:48,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:48,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730501992] [2020-02-10 19:50:48,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:48,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:48,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:48,276 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:50:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:48,408 INFO L93 Difference]: Finished difference Result 1253 states and 4411 transitions. [2020-02-10 19:50:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:48,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:48,412 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 19:50:48,412 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 19:50:48,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 19:50:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 784. [2020-02-10 19:50:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:50:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 19:50:48,434 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 19:50:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:48,434 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 19:50:48,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 19:50:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:48,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:48,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:48,435 INFO L427 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 891396219, now seen corresponding path program 742 times [2020-02-10 19:50:48,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:48,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640961457] [2020-02-10 19:50:48,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:48,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640961457] [2020-02-10 19:50:48,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:48,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424852140] [2020-02-10 19:50:48,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:48,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:48,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:48,795 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:50:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:48,933 INFO L93 Difference]: Finished difference Result 1254 states and 4407 transitions. [2020-02-10 19:50:48,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:48,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:48,937 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 19:50:48,937 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:50:48,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:50:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-02-10 19:50:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:50:48,958 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:50:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:48,959 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:50:48,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:50:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:48,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:48,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:48,960 INFO L427 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1974984703, now seen corresponding path program 743 times [2020-02-10 19:50:48,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:48,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329966203] [2020-02-10 19:50:48,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:49,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 19:50:49,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329966203] [2020-02-10 19:50:49,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:49,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:49,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343185323] [2020-02-10 19:50:49,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:49,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:49,328 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:50:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:49,485 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 19:50:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:49,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:49,489 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:50:49,489 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:50:49,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:50:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 19:50:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:50:49,510 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:50:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:49,511 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:50:49,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:50:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:49,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:49,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] [2020-02-10 19:50:49,512 INFO L427 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:49,512 INFO L82 PathProgramCache]: Analyzing trace with hash -709041635, now seen corresponding path program 744 times [2020-02-10 19:50:49,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:49,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841878913] [2020-02-10 19:50:49,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:49,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841878913] [2020-02-10 19:50:49,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:49,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:49,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051729832] [2020-02-10 19:50:49,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:49,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:49,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:49,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:49,872 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:50:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:50,032 INFO L93 Difference]: Finished difference Result 1248 states and 4392 transitions. [2020-02-10 19:50:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:50,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:50,035 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:50:50,035 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:50:50,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:50:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 772. [2020-02-10 19:50:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 19:50:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3092 transitions. [2020-02-10 19:50:50,056 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3092 transitions. Word has length 25 [2020-02-10 19:50:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:50,057 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3092 transitions. [2020-02-10 19:50:50,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3092 transitions. [2020-02-10 19:50:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:50,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:50,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:50,058 INFO L427 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1367107491, now seen corresponding path program 745 times [2020-02-10 19:50:50,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:50,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631175633] [2020-02-10 19:50:50,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:50,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631175633] [2020-02-10 19:50:50,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:50,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:50,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538150510] [2020-02-10 19:50:50,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:50,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:50,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:50,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:50,423 INFO L87 Difference]: Start difference. First operand 772 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:50:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:50,561 INFO L93 Difference]: Finished difference Result 1238 states and 4385 transitions. [2020-02-10 19:50:50,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:50,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:50,564 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:50:50,564 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:50:50,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:50:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 782. [2020-02-10 19:50:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:50:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-02-10 19:50:50,586 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-02-10 19:50:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:50,586 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-02-10 19:50:50,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-02-10 19:50:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:50,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:50,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:50,587 INFO L427 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -396855877, now seen corresponding path program 746 times [2020-02-10 19:50:50,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:50,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80260096] [2020-02-10 19:50:50,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:50,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80260096] [2020-02-10 19:50:50,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:50,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:50,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977778151] [2020-02-10 19:50:50,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:50,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:50,952 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:50:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:51,091 INFO L93 Difference]: Finished difference Result 1240 states and 4385 transitions. [2020-02-10 19:50:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:51,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:51,094 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:50:51,094 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 19:50:51,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 19:50:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-02-10 19:50:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-02-10 19:50:51,115 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-02-10 19:50:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:51,115 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-02-10 19:50:51,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-02-10 19:50:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:51,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:51,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:51,117 INFO L427 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 558926587, now seen corresponding path program 747 times [2020-02-10 19:50:51,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:51,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981030374] [2020-02-10 19:50:51,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:51,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981030374] [2020-02-10 19:50:51,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:51,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:51,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541098239] [2020-02-10 19:50:51,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:51,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:51,506 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:50:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:51,687 INFO L93 Difference]: Finished difference Result 1234 states and 4373 transitions. [2020-02-10 19:50:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:51,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:51,690 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 19:50:51,690 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 19:50:51,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 19:50:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 19:50:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 19:50:51,711 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 19:50:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:51,711 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 19:50:51,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 19:50:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:51,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:51,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:51,713 INFO L427 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1539681305, now seen corresponding path program 748 times [2020-02-10 19:50:51,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:51,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335885015] [2020-02-10 19:50:51,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:52,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335885015] [2020-02-10 19:50:52,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:52,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:52,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450566894] [2020-02-10 19:50:52,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:52,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:52,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:52,076 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:50:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:52,216 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-02-10 19:50:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:52,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:52,220 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:50:52,220 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:50:52,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:50:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 19:50:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-02-10 19:50:52,256 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-02-10 19:50:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:52,256 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-02-10 19:50:52,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-02-10 19:50:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:52,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:52,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] [2020-02-10 19:50:52,257 INFO L427 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash -58230691, now seen corresponding path program 749 times [2020-02-10 19:50:52,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:52,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693332757] [2020-02-10 19:50:52,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:52,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693332757] [2020-02-10 19:50:52,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:52,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:52,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924215062] [2020-02-10 19:50:52,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:52,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:52,624 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:50:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:52,762 INFO L93 Difference]: Finished difference Result 1238 states and 4378 transitions. [2020-02-10 19:50:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:52,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:52,765 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:50:52,765 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:50:52,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:50:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-02-10 19:50:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 19:50:52,787 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 19:50:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:52,787 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 19:50:52,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 19:50:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:52,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:52,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:52,788 INFO L427 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1552710267, now seen corresponding path program 750 times [2020-02-10 19:50:52,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:52,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769272991] [2020-02-10 19:50:52,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:53,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 19:50:53,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769272991] [2020-02-10 19:50:53,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:53,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:53,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239600270] [2020-02-10 19:50:53,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:53,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:53,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:53,153 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:50:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:53,300 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-02-10 19:50:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:53,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:53,304 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 19:50:53,304 INFO L226 Difference]: Without dead ends: 1217 [2020-02-10 19:50:53,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-02-10 19:50:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 775. [2020-02-10 19:50:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:50:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-02-10 19:50:53,326 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-02-10 19:50:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:53,326 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-02-10 19:50:53,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-02-10 19:50:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:53,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:53,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:53,327 INFO L427 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2082888353, now seen corresponding path program 751 times [2020-02-10 19:50:53,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:53,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856031422] [2020-02-10 19:50:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:53,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856031422] [2020-02-10 19:50:53,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:53,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:53,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208779708] [2020-02-10 19:50:53,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:53,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:53,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:53,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:53,692 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:50:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:53,870 INFO L93 Difference]: Finished difference Result 1244 states and 4399 transitions. [2020-02-10 19:50:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:53,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:53,873 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:50:53,873 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 19:50:53,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 19:50:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 783. [2020-02-10 19:50:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:50:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3125 transitions. [2020-02-10 19:50:53,895 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3125 transitions. Word has length 25 [2020-02-10 19:50:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:53,895 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3125 transitions. [2020-02-10 19:50:53,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3125 transitions. [2020-02-10 19:50:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:53,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:53,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:53,896 INFO L427 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1241827329, now seen corresponding path program 752 times [2020-02-10 19:50:53,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:53,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872129277] [2020-02-10 19:50:53,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:54,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872129277] [2020-02-10 19:50:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:54,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:54,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514109319] [2020-02-10 19:50:54,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:54,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:54,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:54,291 INFO L87 Difference]: Start difference. First operand 783 states and 3125 transitions. Second operand 10 states. [2020-02-10 19:50:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:54,433 INFO L93 Difference]: Finished difference Result 1246 states and 4399 transitions. [2020-02-10 19:50:54,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:54,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:54,436 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:50:54,436 INFO L226 Difference]: Without dead ends: 1227 [2020-02-10 19:50:54,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-02-10 19:50:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 779. [2020-02-10 19:50:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:50:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3114 transitions. [2020-02-10 19:50:54,457 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3114 transitions. Word has length 25 [2020-02-10 19:50:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:54,457 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3114 transitions. [2020-02-10 19:50:54,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3114 transitions. [2020-02-10 19:50:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:54,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:54,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:54,459 INFO L427 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -728944005, now seen corresponding path program 753 times [2020-02-10 19:50:54,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:54,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764697694] [2020-02-10 19:50:54,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:54,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764697694] [2020-02-10 19:50:54,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:54,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:54,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817083206] [2020-02-10 19:50:54,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:54,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:54,854 INFO L87 Difference]: Start difference. First operand 779 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:50:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:54,993 INFO L93 Difference]: Finished difference Result 1243 states and 4393 transitions. [2020-02-10 19:50:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:54,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:54,996 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:50:54,997 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:50:54,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:50:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 19:50:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:50:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3121 transitions. [2020-02-10 19:50:55,018 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3121 transitions. Word has length 25 [2020-02-10 19:50:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:55,018 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3121 transitions. [2020-02-10 19:50:55,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3121 transitions. [2020-02-10 19:50:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:55,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:55,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:55,019 INFO L427 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 272816921, now seen corresponding path program 754 times [2020-02-10 19:50:55,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:55,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607367647] [2020-02-10 19:50:55,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:55,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607367647] [2020-02-10 19:50:55,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:55,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:55,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539875587] [2020-02-10 19:50:55,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:55,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:55,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:55,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:55,388 INFO L87 Difference]: Start difference. First operand 783 states and 3121 transitions. Second operand 10 states. [2020-02-10 19:50:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:55,529 INFO L93 Difference]: Finished difference Result 1244 states and 4391 transitions. [2020-02-10 19:50:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:55,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:55,533 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:50:55,533 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:50:55,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:50:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 19:50:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:50:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3110 transitions. [2020-02-10 19:50:55,554 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3110 transitions. Word has length 25 [2020-02-10 19:50:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:55,555 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3110 transitions. [2020-02-10 19:50:55,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3110 transitions. [2020-02-10 19:50:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:55,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:55,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:55,556 INFO L427 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash -252009695, now seen corresponding path program 755 times [2020-02-10 19:50:55,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:55,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684156241] [2020-02-10 19:50:55,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:55,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 19:50:55,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684156241] [2020-02-10 19:50:55,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:55,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:55,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460420375] [2020-02-10 19:50:55,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:55,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:55,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:55,931 INFO L87 Difference]: Start difference. First operand 779 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:50:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,071 INFO L93 Difference]: Finished difference Result 1248 states and 4400 transitions. [2020-02-10 19:50:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:56,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,074 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:50:56,074 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 19:50:56,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 19:50:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 784. [2020-02-10 19:50:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:50:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 19:50:56,096 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 19:50:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:56,096 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 19:50:56,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 19:50:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:56,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:56,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:56,097 INFO L427 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash 285845883, now seen corresponding path program 756 times [2020-02-10 19:50:56,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:56,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907135027] [2020-02-10 19:50:56,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:56,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907135027] [2020-02-10 19:50:56,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:56,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:56,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963498185] [2020-02-10 19:50:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:56,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:56,461 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:50:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,604 INFO L93 Difference]: Finished difference Result 1247 states and 4393 transitions. [2020-02-10 19:50:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:56,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,608 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 19:50:56,608 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:50:56,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:50:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 775. [2020-02-10 19:50:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:50:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-02-10 19:50:56,629 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-02-10 19:50:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:56,629 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-02-10 19:50:56,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-02-10 19:50:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:56,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:56,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:56,630 INFO L427 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash -708530591, now seen corresponding path program 757 times [2020-02-10 19:50:56,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:56,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090711118] [2020-02-10 19:50:56,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:57,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090711118] [2020-02-10 19:50:57,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:57,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:57,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034138871] [2020-02-10 19:50:57,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:57,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:57,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:57,012 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:50:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:57,170 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-02-10 19:50:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:57,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:57,174 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:50:57,174 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:50:57,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:50:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 781. [2020-02-10 19:50:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 19:50:57,197 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 19:50:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,197 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 19:50:57,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 19:50:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:57,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:57,198 INFO L427 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash 272224127, now seen corresponding path program 758 times [2020-02-10 19:50:57,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950930060] [2020-02-10 19:50:57,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:57,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950930060] [2020-02-10 19:50:57,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:57,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:57,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949612354] [2020-02-10 19:50:57,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:57,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:57,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:57,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:57,568 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:50:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:57,711 INFO L93 Difference]: Finished difference Result 1232 states and 4363 transitions. [2020-02-10 19:50:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:57,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:57,714 INFO L225 Difference]: With dead ends: 1232 [2020-02-10 19:50:57,714 INFO L226 Difference]: Without dead ends: 1217 [2020-02-10 19:50:57,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-02-10 19:50:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 778. [2020-02-10 19:50:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 19:50:57,735 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 19:50:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,736 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 19:50:57,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 19:50:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:57,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:57,737 INFO L427 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1151429731, now seen corresponding path program 759 times [2020-02-10 19:50:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334077315] [2020-02-10 19:50:57,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:58,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334077315] [2020-02-10 19:50:58,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:58,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:58,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605514703] [2020-02-10 19:50:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:58,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:58,104 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:50:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:58,236 INFO L93 Difference]: Finished difference Result 1236 states and 4372 transitions. [2020-02-10 19:50:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:58,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:58,239 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 19:50:58,239 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:50:58,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:50:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 782. [2020-02-10 19:50:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:50:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-02-10 19:50:58,261 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-02-10 19:50:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:58,261 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-02-10 19:50:58,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-02-10 19:50:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:58,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:58,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:58,262 INFO L427 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -149668805, now seen corresponding path program 760 times [2020-02-10 19:50:58,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:58,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083584751] [2020-02-10 19:50:58,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:58,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083584751] [2020-02-10 19:50:58,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:58,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:58,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164499952] [2020-02-10 19:50:58,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:58,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:58,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:58,634 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-02-10 19:50:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:58,769 INFO L93 Difference]: Finished difference Result 1237 states and 4370 transitions. [2020-02-10 19:50:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:58,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:58,772 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:50:58,772 INFO L226 Difference]: Without dead ends: 1219 [2020-02-10 19:50:58,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2020-02-10 19:50:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 778. [2020-02-10 19:50:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:50:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:50:58,794 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:50:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:58,794 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:50:58,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:50:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:58,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:58,796 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:58,796 INFO L427 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:58,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1262041761, now seen corresponding path program 761 times [2020-02-10 19:50:58,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:58,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115014522] [2020-02-10 19:50:58,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:59,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115014522] [2020-02-10 19:50:59,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:59,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644193741] [2020-02-10 19:50:59,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:59,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:59,164 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:50:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:59,294 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-02-10 19:50:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:59,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:59,297 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:50:59,298 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 19:50:59,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 19:50:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 19:50:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:50:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:50:59,336 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:50:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:59,336 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:50:59,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:50:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:59,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:59,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:59,337 INFO L427 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 188956381, now seen corresponding path program 762 times [2020-02-10 19:50:59,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:59,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471561043] [2020-02-10 19:50:59,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:59,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471561043] [2020-02-10 19:50:59,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:50:59,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034453012] [2020-02-10 19:50:59,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:50:59,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:50:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:50:59,707 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:50:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:59,841 INFO L93 Difference]: Finished difference Result 1235 states and 4363 transitions. [2020-02-10 19:50:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:50:59,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:50:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:59,845 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 19:50:59,845 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 19:50:59,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 19:50:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 775. [2020-02-10 19:50:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:50:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 19:50:59,867 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 19:50:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:59,867 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 19:50:59,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:50:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 19:50:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:50:59,868 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:59,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:59,869 INFO L427 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 561344891, now seen corresponding path program 763 times [2020-02-10 19:50:59,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:59,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415441086] [2020-02-10 19:50:59,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:00,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415441086] [2020-02-10 19:51:00,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:00,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:00,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415130425] [2020-02-10 19:51:00,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:00,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:00,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:00,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:00,231 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:51:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,363 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-02-10 19:51:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:00,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,367 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:51:00,367 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:51:00,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:51:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-02-10 19:51:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 19:51:00,388 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 19:51:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:00,389 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 19:51:00,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 19:51:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:00,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:00,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:00,390 INFO L427 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2122681447, now seen corresponding path program 764 times [2020-02-10 19:51:00,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:00,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846034884] [2020-02-10 19:51:00,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:00,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846034884] [2020-02-10 19:51:00,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:00,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:00,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881172193] [2020-02-10 19:51:00,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:00,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:00,830 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:51:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,950 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-02-10 19:51:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:00,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,953 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:51:00,953 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 19:51:00,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 19:51:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-02-10 19:51:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:51:00,978 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:00,978 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:51:00,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:51:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:00,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:00,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:00,979 INFO L427 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1655436479, now seen corresponding path program 765 times [2020-02-10 19:51:00,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:00,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122780754] [2020-02-10 19:51:00,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:01,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 19:51:01,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122780754] [2020-02-10 19:51:01,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:01,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:01,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595959141] [2020-02-10 19:51:01,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:01,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:01,347 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:01,475 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 19:51:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:01,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:01,479 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:51:01,479 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 19:51:01,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 19:51:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-02-10 19:51:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3114 transitions. [2020-02-10 19:51:01,501 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3114 transitions. Word has length 25 [2020-02-10 19:51:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:01,501 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3114 transitions. [2020-02-10 19:51:01,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3114 transitions. [2020-02-10 19:51:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:01,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:01,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:01,502 INFO L427 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2101675239, now seen corresponding path program 766 times [2020-02-10 19:51:01,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:01,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790543113] [2020-02-10 19:51:01,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:01,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790543113] [2020-02-10 19:51:01,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:01,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:01,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101691597] [2020-02-10 19:51:01,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:01,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:01,881 INFO L87 Difference]: Start difference. First operand 783 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:51:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:02,022 INFO L93 Difference]: Finished difference Result 1243 states and 4380 transitions. [2020-02-10 19:51:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:02,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:02,025 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:51:02,025 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:51:02,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:51:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 19:51:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 19:51:02,047 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:02,047 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 19:51:02,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 19:51:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:02,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:02,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:02,048 INFO L427 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1665939583, now seen corresponding path program 767 times [2020-02-10 19:51:02,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:02,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924206983] [2020-02-10 19:51:02,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:02,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924206983] [2020-02-10 19:51:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:02,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975385854] [2020-02-10 19:51:02,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:02,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:02,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:02,413 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:02,560 INFO L93 Difference]: Finished difference Result 1236 states and 4366 transitions. [2020-02-10 19:51:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:02,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:02,564 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 19:51:02,564 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:51:02,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:51:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-02-10 19:51:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 19:51:02,585 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 19:51:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:02,585 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 19:51:02,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 19:51:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:02,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:02,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:02,586 INFO L427 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:02,587 INFO L82 PathProgramCache]: Analyzing trace with hash 592854203, now seen corresponding path program 768 times [2020-02-10 19:51:02,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:02,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822531810] [2020-02-10 19:51:02,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:02,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 19:51:02,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822531810] [2020-02-10 19:51:02,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:02,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:02,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100179326] [2020-02-10 19:51:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:02,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:02,949 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:51:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:03,076 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-02-10 19:51:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:03,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:03,079 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:51:03,080 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 19:51:03,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 19:51:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 772. [2020-02-10 19:51:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 19:51:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3089 transitions. [2020-02-10 19:51:03,101 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3089 transitions. Word has length 25 [2020-02-10 19:51:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:03,101 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3089 transitions. [2020-02-10 19:51:03,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3089 transitions. [2020-02-10 19:51:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:03,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:03,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:03,102 INFO L427 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2001748835, now seen corresponding path program 769 times [2020-02-10 19:51:03,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:03,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571713129] [2020-02-10 19:51:03,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:03,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571713129] [2020-02-10 19:51:03,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:03,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:03,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455897306] [2020-02-10 19:51:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:03,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:03,467 INFO L87 Difference]: Start difference. First operand 772 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:51:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:03,617 INFO L93 Difference]: Finished difference Result 1262 states and 4453 transitions. [2020-02-10 19:51:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:03,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:03,621 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 19:51:03,621 INFO L226 Difference]: Without dead ends: 1249 [2020-02-10 19:51:03,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2020-02-10 19:51:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 784. [2020-02-10 19:51:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-02-10 19:51:03,643 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-02-10 19:51:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:03,643 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-02-10 19:51:03,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-02-10 19:51:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:03,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:03,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:03,645 INFO L427 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1031497221, now seen corresponding path program 770 times [2020-02-10 19:51:03,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:03,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601482131] [2020-02-10 19:51:03,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:04,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601482131] [2020-02-10 19:51:04,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:04,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:04,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399189790] [2020-02-10 19:51:04,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:04,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:04,018 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-02-10 19:51:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:04,154 INFO L93 Difference]: Finished difference Result 1264 states and 4453 transitions. [2020-02-10 19:51:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:04,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:04,158 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 19:51:04,158 INFO L226 Difference]: Without dead ends: 1245 [2020-02-10 19:51:04,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-02-10 19:51:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 780. [2020-02-10 19:51:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3119 transitions. [2020-02-10 19:51:04,180 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3119 transitions. Word has length 25 [2020-02-10 19:51:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:04,180 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3119 transitions. [2020-02-10 19:51:04,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3119 transitions. [2020-02-10 19:51:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:04,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:04,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:04,181 INFO L427 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1850319321, now seen corresponding path program 771 times [2020-02-10 19:51:04,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:04,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701979515] [2020-02-10 19:51:04,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:04,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701979515] [2020-02-10 19:51:04,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:04,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:04,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217303316] [2020-02-10 19:51:04,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:04,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:04,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:04,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:04,545 INFO L87 Difference]: Start difference. First operand 780 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:51:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:04,681 INFO L93 Difference]: Finished difference Result 1263 states and 4451 transitions. [2020-02-10 19:51:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:04,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:04,684 INFO L225 Difference]: With dead ends: 1263 [2020-02-10 19:51:04,684 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 19:51:04,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 19:51:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 784. [2020-02-10 19:51:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-02-10 19:51:04,706 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-02-10 19:51:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:04,706 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-02-10 19:51:04,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-02-10 19:51:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:04,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:04,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:04,707 INFO L427 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1453390153, now seen corresponding path program 772 times [2020-02-10 19:51:04,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:04,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990269849] [2020-02-10 19:51:04,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:05,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990269849] [2020-02-10 19:51:05,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:05,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:05,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678492101] [2020-02-10 19:51:05,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:05,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:05,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:05,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:05,075 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:51:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:05,214 INFO L93 Difference]: Finished difference Result 1266 states and 4453 transitions. [2020-02-10 19:51:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:05,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:05,217 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 19:51:05,218 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 19:51:05,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 19:51:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 780. [2020-02-10 19:51:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-02-10 19:51:05,239 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-02-10 19:51:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:05,239 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-02-10 19:51:05,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-02-10 19:51:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:05,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:05,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:05,240 INFO L427 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash -367275811, now seen corresponding path program 773 times [2020-02-10 19:51:05,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:05,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441437145] [2020-02-10 19:51:05,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:05,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 19:51:05,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441437145] [2020-02-10 19:51:05,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:05,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:05,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935322944] [2020-02-10 19:51:05,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:05,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:05,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:05,606 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-02-10 19:51:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:05,734 INFO L93 Difference]: Finished difference Result 1269 states and 4461 transitions. [2020-02-10 19:51:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:05,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:05,737 INFO L225 Difference]: With dead ends: 1269 [2020-02-10 19:51:05,738 INFO L226 Difference]: Without dead ends: 1254 [2020-02-10 19:51:05,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2020-02-10 19:51:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 786. [2020-02-10 19:51:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:51:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3126 transitions. [2020-02-10 19:51:05,759 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3126 transitions. Word has length 25 [2020-02-10 19:51:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:05,759 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3126 transitions. [2020-02-10 19:51:05,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3126 transitions. [2020-02-10 19:51:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:05,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:05,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:05,761 INFO L427 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1440361191, now seen corresponding path program 774 times [2020-02-10 19:51:05,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:05,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238758706] [2020-02-10 19:51:05,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:06,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238758706] [2020-02-10 19:51:06,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:06,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:06,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956035010] [2020-02-10 19:51:06,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:06,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:06,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:06,135 INFO L87 Difference]: Start difference. First operand 786 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:51:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:06,262 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-02-10 19:51:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:06,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:06,265 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 19:51:06,266 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 19:51:06,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 19:51:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 776. [2020-02-10 19:51:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:51:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3104 transitions. [2020-02-10 19:51:06,288 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3104 transitions. Word has length 25 [2020-02-10 19:51:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:06,288 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3104 transitions. [2020-02-10 19:51:06,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3104 transitions. [2020-02-10 19:51:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:06,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:06,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:06,289 INFO L427 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1870732735, now seen corresponding path program 775 times [2020-02-10 19:51:06,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:06,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71534264] [2020-02-10 19:51:06,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:06,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71534264] [2020-02-10 19:51:06,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:06,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:06,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763943596] [2020-02-10 19:51:06,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:06,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:06,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:06,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:06,650 INFO L87 Difference]: Start difference. First operand 776 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:51:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:06,774 INFO L93 Difference]: Finished difference Result 1259 states and 4442 transitions. [2020-02-10 19:51:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:06,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:06,777 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 19:51:06,777 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 19:51:06,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 19:51:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-02-10 19:51:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-02-10 19:51:06,800 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-02-10 19:51:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:06,800 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-02-10 19:51:06,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-02-10 19:51:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:06,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:06,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:06,801 INFO L427 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1453982947, now seen corresponding path program 776 times [2020-02-10 19:51:06,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:06,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786817825] [2020-02-10 19:51:06,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:07,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786817825] [2020-02-10 19:51:07,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:07,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:07,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137578275] [2020-02-10 19:51:07,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:07,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:07,165 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:51:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:07,320 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-02-10 19:51:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:07,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:07,324 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 19:51:07,324 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:51:07,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:51:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 19:51:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-02-10 19:51:07,346 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-02-10 19:51:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:07,346 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-02-10 19:51:07,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-02-10 19:51:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:07,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:07,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:07,347 INFO L427 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -941099623, now seen corresponding path program 777 times [2020-02-10 19:51:07,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:07,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455109855] [2020-02-10 19:51:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:07,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455109855] [2020-02-10 19:51:07,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:07,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:07,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656350108] [2020-02-10 19:51:07,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:07,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:07,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:07,721 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-02-10 19:51:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:07,857 INFO L93 Difference]: Finished difference Result 1258 states and 4436 transitions. [2020-02-10 19:51:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:07,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:07,860 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 19:51:07,860 INFO L226 Difference]: Without dead ends: 1245 [2020-02-10 19:51:07,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-02-10 19:51:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 784. [2020-02-10 19:51:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-02-10 19:51:07,881 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-02-10 19:51:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:07,881 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-02-10 19:51:07,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-02-10 19:51:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:07,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:07,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:07,882 INFO L427 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash 60661303, now seen corresponding path program 778 times [2020-02-10 19:51:07,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:07,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668872895] [2020-02-10 19:51:07,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:08,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 19:51:08,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668872895] [2020-02-10 19:51:08,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:08,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:08,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234250759] [2020-02-10 19:51:08,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:08,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:08,270 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:51:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:08,403 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-02-10 19:51:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:08,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:08,406 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 19:51:08,406 INFO L226 Difference]: Without dead ends: 1241 [2020-02-10 19:51:08,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-02-10 19:51:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 780. [2020-02-10 19:51:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 19:51:08,428 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 19:51:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:08,428 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 19:51:08,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 19:51:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:08,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:08,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:08,430 INFO L427 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -464165313, now seen corresponding path program 779 times [2020-02-10 19:51:08,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:08,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750713016] [2020-02-10 19:51:08,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:08,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750713016] [2020-02-10 19:51:08,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:08,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:08,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463934295] [2020-02-10 19:51:08,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:08,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:08,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:08,799 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:51:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:08,926 INFO L93 Difference]: Finished difference Result 1263 states and 4443 transitions. [2020-02-10 19:51:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:08,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:08,929 INFO L225 Difference]: With dead ends: 1263 [2020-02-10 19:51:08,929 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 19:51:08,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 19:51:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-02-10 19:51:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:51:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-02-10 19:51:08,951 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-02-10 19:51:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:08,951 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-02-10 19:51:08,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-02-10 19:51:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:08,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:08,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:08,952 INFO L427 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:08,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash 73690265, now seen corresponding path program 780 times [2020-02-10 19:51:08,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:08,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809122755] [2020-02-10 19:51:08,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:09,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809122755] [2020-02-10 19:51:09,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:09,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:09,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370309420] [2020-02-10 19:51:09,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:09,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:09,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:09,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:09,321 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:51:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:09,468 INFO L93 Difference]: Finished difference Result 1262 states and 4436 transitions. [2020-02-10 19:51:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:09,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:09,472 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 19:51:09,472 INFO L226 Difference]: Without dead ends: 1239 [2020-02-10 19:51:09,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-02-10 19:51:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 776. [2020-02-10 19:51:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:51:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-02-10 19:51:09,494 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-02-10 19:51:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:09,494 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-02-10 19:51:09,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-02-10 19:51:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:09,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:09,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:09,495 INFO L427 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash 582862143, now seen corresponding path program 781 times [2020-02-10 19:51:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:09,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311968430] [2020-02-10 19:51:09,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:09,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311968430] [2020-02-10 19:51:09,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:09,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:09,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614223482] [2020-02-10 19:51:09,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:09,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:09,855 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:51:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:10,002 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-02-10 19:51:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:10,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:10,005 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 19:51:10,005 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 19:51:10,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 19:51:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 784. [2020-02-10 19:51:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-02-10 19:51:10,027 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-02-10 19:51:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,027 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-02-10 19:51:10,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-02-10 19:51:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:10,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:10,028 INFO L427 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1574119965, now seen corresponding path program 782 times [2020-02-10 19:51:10,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020283901] [2020-02-10 19:51:10,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:10,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020283901] [2020-02-10 19:51:10,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:10,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:10,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76015143] [2020-02-10 19:51:10,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:10,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:10,387 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-02-10 19:51:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:10,536 INFO L93 Difference]: Finished difference Result 1264 states and 4444 transitions. [2020-02-10 19:51:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:10,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:10,539 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 19:51:10,539 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 19:51:10,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 19:51:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-02-10 19:51:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 19:51:10,562 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 19:51:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,562 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 19:51:10,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 19:51:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:10,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,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] [2020-02-10 19:51:10,564 INFO L427 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1786071075, now seen corresponding path program 783 times [2020-02-10 19:51:10,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374898904] [2020-02-10 19:51:10,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374898904] [2020-02-10 19:51:10,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:10,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:10,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197899920] [2020-02-10 19:51:10,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:10,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:10,933 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:51:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:11,063 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-02-10 19:51:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:11,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:11,066 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 19:51:11,067 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 19:51:11,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 19:51:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-02-10 19:51:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3118 transitions. [2020-02-10 19:51:11,088 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3118 transitions. Word has length 25 [2020-02-10 19:51:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:11,088 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3118 transitions. [2020-02-10 19:51:11,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3118 transitions. [2020-02-10 19:51:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:11,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:11,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:11,090 INFO L427 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash -784310149, now seen corresponding path program 784 times [2020-02-10 19:51:11,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:11,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263433808] [2020-02-10 19:51:11,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:11,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263433808] [2020-02-10 19:51:11,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:11,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:11,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922567073] [2020-02-10 19:51:11,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:11,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:11,458 INFO L87 Difference]: Start difference. First operand 784 states and 3118 transitions. Second operand 10 states. [2020-02-10 19:51:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:11,614 INFO L93 Difference]: Finished difference Result 1260 states and 4432 transitions. [2020-02-10 19:51:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:11,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:11,617 INFO L225 Difference]: With dead ends: 1260 [2020-02-10 19:51:11,617 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:51:11,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:51:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 19:51:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3107 transitions. [2020-02-10 19:51:11,639 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3107 transitions. Word has length 25 [2020-02-10 19:51:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:11,639 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3107 transitions. [2020-02-10 19:51:11,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3107 transitions. [2020-02-10 19:51:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:11,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:11,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:11,640 INFO L427 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1731029697, now seen corresponding path program 785 times [2020-02-10 19:51:11,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769593590] [2020-02-10 19:51:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:12,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769593590] [2020-02-10 19:51:12,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:12,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:12,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729622417] [2020-02-10 19:51:12,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:12,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:12,018 INFO L87 Difference]: Start difference. First operand 780 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:51:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:12,170 INFO L93 Difference]: Finished difference Result 1266 states and 4445 transitions. [2020-02-10 19:51:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:12,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:12,174 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 19:51:12,174 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 19:51:12,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 19:51:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 785. [2020-02-10 19:51:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:51:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3116 transitions. [2020-02-10 19:51:12,195 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3116 transitions. Word has length 25 [2020-02-10 19:51:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:12,195 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3116 transitions. [2020-02-10 19:51:12,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3116 transitions. [2020-02-10 19:51:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:12,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:12,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:12,196 INFO L427 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash -120088739, now seen corresponding path program 786 times [2020-02-10 19:51:12,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:12,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185767274] [2020-02-10 19:51:12,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:12,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185767274] [2020-02-10 19:51:12,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:12,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:12,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970625892] [2020-02-10 19:51:12,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:12,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:12,553 INFO L87 Difference]: Start difference. First operand 785 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:51:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:12,710 INFO L93 Difference]: Finished difference Result 1264 states and 4436 transitions. [2020-02-10 19:51:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:12,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:12,714 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 19:51:12,714 INFO L226 Difference]: Without dead ends: 1241 [2020-02-10 19:51:12,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-02-10 19:51:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 776. [2020-02-10 19:51:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:51:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 19:51:12,735 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 19:51:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:12,736 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 19:51:12,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 19:51:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:12,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:12,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:12,737 INFO L427 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash 252299771, now seen corresponding path program 787 times [2020-02-10 19:51:12,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:12,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859767766] [2020-02-10 19:51:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:13,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859767766] [2020-02-10 19:51:13,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:13,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:13,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960555017] [2020-02-10 19:51:13,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:13,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:13,102 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:51:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:13,252 INFO L93 Difference]: Finished difference Result 1273 states and 4469 transitions. [2020-02-10 19:51:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:13,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:13,256 INFO L225 Difference]: With dead ends: 1273 [2020-02-10 19:51:13,256 INFO L226 Difference]: Without dead ends: 1258 [2020-02-10 19:51:13,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2020-02-10 19:51:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 787. [2020-02-10 19:51:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 19:51:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3126 transitions. [2020-02-10 19:51:13,278 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3126 transitions. Word has length 25 [2020-02-10 19:51:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:13,279 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3126 transitions. [2020-02-10 19:51:13,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3126 transitions. [2020-02-10 19:51:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:13,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:13,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] [2020-02-10 19:51:13,280 INFO L427 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -820785609, now seen corresponding path program 788 times [2020-02-10 19:51:13,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:13,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748202425] [2020-02-10 19:51:13,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:13,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748202425] [2020-02-10 19:51:13,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:13,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:13,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944435697] [2020-02-10 19:51:13,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:13,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:13,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:13,666 INFO L87 Difference]: Start difference. First operand 787 states and 3126 transitions. Second operand 10 states. [2020-02-10 19:51:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:13,795 INFO L93 Difference]: Finished difference Result 1274 states and 4465 transitions. [2020-02-10 19:51:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:13,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:13,799 INFO L225 Difference]: With dead ends: 1274 [2020-02-10 19:51:13,799 INFO L226 Difference]: Without dead ends: 1252 [2020-02-10 19:51:13,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-02-10 19:51:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 781. [2020-02-10 19:51:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:51:13,820 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:51:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:13,821 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:51:13,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:51:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:13,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:13,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] [2020-02-10 19:51:13,822 INFO L427 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1348138083, now seen corresponding path program 789 times [2020-02-10 19:51:13,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:13,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158711091] [2020-02-10 19:51:13,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:14,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158711091] [2020-02-10 19:51:14,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:14,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:14,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902350456] [2020-02-10 19:51:14,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:14,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:14,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:14,194 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:51:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:14,326 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-02-10 19:51:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:14,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:14,329 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 19:51:14,329 INFO L226 Difference]: Without dead ends: 1255 [2020-02-10 19:51:14,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-02-10 19:51:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 786. [2020-02-10 19:51:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:51:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3119 transitions. [2020-02-10 19:51:14,351 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3119 transitions. Word has length 25 [2020-02-10 19:51:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:14,351 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3119 transitions. [2020-02-10 19:51:14,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3119 transitions. [2020-02-10 19:51:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:14,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:14,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:14,352 INFO L427 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash -810282505, now seen corresponding path program 790 times [2020-02-10 19:51:14,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:14,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055071229] [2020-02-10 19:51:14,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:14,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055071229] [2020-02-10 19:51:14,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:14,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:14,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715044430] [2020-02-10 19:51:14,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:14,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:14,725 INFO L87 Difference]: Start difference. First operand 786 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:51:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:14,869 INFO L93 Difference]: Finished difference Result 1269 states and 4450 transitions. [2020-02-10 19:51:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:14,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:14,873 INFO L225 Difference]: With dead ends: 1269 [2020-02-10 19:51:14,873 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 19:51:14,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 19:51:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 781. [2020-02-10 19:51:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3105 transitions. [2020-02-10 19:51:14,894 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:14,895 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3105 transitions. [2020-02-10 19:51:14,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3105 transitions. [2020-02-10 19:51:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:14,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:14,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:14,896 INFO L427 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1327131875, now seen corresponding path program 791 times [2020-02-10 19:51:14,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:14,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043145408] [2020-02-10 19:51:14,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:15,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043145408] [2020-02-10 19:51:15,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:15,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:15,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446363515] [2020-02-10 19:51:15,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:15,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:15,264 INFO L87 Difference]: Start difference. First operand 781 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:15,402 INFO L93 Difference]: Finished difference Result 1272 states and 4456 transitions. [2020-02-10 19:51:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:15,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:15,406 INFO L225 Difference]: With dead ends: 1272 [2020-02-10 19:51:15,406 INFO L226 Difference]: Without dead ends: 1256 [2020-02-10 19:51:15,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2020-02-10 19:51:15,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 786. [2020-02-10 19:51:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:51:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3114 transitions. [2020-02-10 19:51:15,427 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3114 transitions. Word has length 25 [2020-02-10 19:51:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:15,427 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3114 transitions. [2020-02-10 19:51:15,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3114 transitions. [2020-02-10 19:51:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:15,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:15,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] [2020-02-10 19:51:15,428 INFO L427 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash 283809083, now seen corresponding path program 792 times [2020-02-10 19:51:15,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:15,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293675266] [2020-02-10 19:51:15,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:15,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293675266] [2020-02-10 19:51:15,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:15,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:15,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296666703] [2020-02-10 19:51:15,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:15,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:15,797 INFO L87 Difference]: Start difference. First operand 786 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:51:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:15,953 INFO L93 Difference]: Finished difference Result 1270 states and 4447 transitions. [2020-02-10 19:51:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:15,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:15,956 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 19:51:15,957 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:51:15,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:51:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 772. [2020-02-10 19:51:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 19:51:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3086 transitions. [2020-02-10 19:51:15,978 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3086 transitions. Word has length 25 [2020-02-10 19:51:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:15,978 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3086 transitions. [2020-02-10 19:51:15,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3086 transitions. [2020-02-10 19:51:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:15,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:15,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:15,979 INFO L427 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -710356101, now seen corresponding path program 793 times [2020-02-10 19:51:15,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:15,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47451069] [2020-02-10 19:51:15,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:16,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47451069] [2020-02-10 19:51:16,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:16,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:16,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749672257] [2020-02-10 19:51:16,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:16,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:16,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:16,349 INFO L87 Difference]: Start difference. First operand 772 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:51:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:16,482 INFO L93 Difference]: Finished difference Result 1236 states and 4374 transitions. [2020-02-10 19:51:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:16,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:16,485 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 19:51:16,485 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:51:16,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:51:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-02-10 19:51:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 19:51:16,507 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 19:51:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:16,507 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 19:51:16,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 19:51:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:16,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:16,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:16,508 INFO L427 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash 270398617, now seen corresponding path program 794 times [2020-02-10 19:51:16,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:16,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497258058] [2020-02-10 19:51:16,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:16,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 19:51:16,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497258058] [2020-02-10 19:51:16,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:16,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:16,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204576247] [2020-02-10 19:51:16,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:16,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:16,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:16,878 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:51:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,034 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-02-10 19:51:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:17,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,038 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 19:51:17,038 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:51:17,038 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:51:17,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 19:51:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 19:51:17,059 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 19:51:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,059 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 19:51:17,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 19:51:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:17,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:17,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:17,061 INFO L427 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:17,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:17,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1215677977, now seen corresponding path program 795 times [2020-02-10 19:51:17,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:17,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437616902] [2020-02-10 19:51:17,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:17,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437616902] [2020-02-10 19:51:17,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:17,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:17,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036610550] [2020-02-10 19:51:17,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:17,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:17,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:17,423 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:51:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,551 INFO L93 Difference]: Finished difference Result 1241 states and 4382 transitions. [2020-02-10 19:51:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:17,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,553 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 19:51:17,553 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:51:17,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:51:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-02-10 19:51:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:51:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-02-10 19:51:17,575 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-02-10 19:51:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,575 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-02-10 19:51:17,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-02-10 19:51:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:17,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:17,576 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:17,576 INFO L427 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2088031497, now seen corresponding path program 796 times [2020-02-10 19:51:17,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:17,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319896218] [2020-02-10 19:51:17,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:17,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319896218] [2020-02-10 19:51:17,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:17,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:17,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811505208] [2020-02-10 19:51:17,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:17,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:17,929 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-02-10 19:51:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:18,058 INFO L93 Difference]: Finished difference Result 1244 states and 4384 transitions. [2020-02-10 19:51:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:18,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:18,061 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:51:18,061 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:51:18,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:51:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 19:51:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:51:18,083 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:18,083 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:51:18,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:51:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:18,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:18,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:18,084 INFO L427 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 934620027, now seen corresponding path program 797 times [2020-02-10 19:51:18,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:18,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122819206] [2020-02-10 19:51:18,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:18,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122819206] [2020-02-10 19:51:18,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:18,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:18,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391037785] [2020-02-10 19:51:18,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:18,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:18,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:18,433 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:18,588 INFO L93 Difference]: Finished difference Result 1238 states and 4372 transitions. [2020-02-10 19:51:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:18,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:18,591 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:51:18,592 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:51:18,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:51:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 19:51:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:51:18,613 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:51:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:18,613 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:51:18,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:51:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:18,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:18,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:18,615 INFO L427 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1749406311, now seen corresponding path program 798 times [2020-02-10 19:51:18,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:18,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34679016] [2020-02-10 19:51:18,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:18,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34679016] [2020-02-10 19:51:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:18,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:18,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670840331] [2020-02-10 19:51:18,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:18,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:18,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:18,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:18,963 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:51:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:19,114 INFO L93 Difference]: Finished difference Result 1242 states and 4377 transitions. [2020-02-10 19:51:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:19,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:19,117 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 19:51:19,118 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:51:19,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:51:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-02-10 19:51:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 19:51:19,138 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 19:51:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:19,139 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 19:51:19,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 19:51:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:19,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:19,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:19,140 INFO L427 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:19,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1132841827, now seen corresponding path program 799 times [2020-02-10 19:51:19,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:19,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316534391] [2020-02-10 19:51:19,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:19,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316534391] [2020-02-10 19:51:19,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:19,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:19,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114288383] [2020-02-10 19:51:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:19,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:19,507 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:51:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:19,656 INFO L93 Difference]: Finished difference Result 1234 states and 4367 transitions. [2020-02-10 19:51:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:19,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:19,659 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 19:51:19,659 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 19:51:19,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 19:51:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 19:51:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 19:51:19,680 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 19:51:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:19,681 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 19:51:19,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 19:51:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:19,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:19,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:19,682 INFO L427 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash -152087109, now seen corresponding path program 800 times [2020-02-10 19:51:19,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:19,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942293596] [2020-02-10 19:51:19,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:20,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942293596] [2020-02-10 19:51:20,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:20,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:20,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611017454] [2020-02-10 19:51:20,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:20,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:20,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:20,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:20,064 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:51:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:20,214 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-02-10 19:51:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:20,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:20,217 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:51:20,217 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:51:20,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:51:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 19:51:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:51:20,238 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:20,239 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:51:20,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:51:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:20,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:20,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:20,240 INFO L427 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1575740967, now seen corresponding path program 801 times [2020-02-10 19:51:20,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:20,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266281541] [2020-02-10 19:51:20,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:20,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266281541] [2020-02-10 19:51:20,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:20,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:20,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124495982] [2020-02-10 19:51:20,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:20,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:20,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:20,608 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:20,754 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-02-10 19:51:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:20,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:20,757 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:51:20,757 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:51:20,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:51:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 782. [2020-02-10 19:51:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:51:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3112 transitions. [2020-02-10 19:51:20,778 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3112 transitions. Word has length 25 [2020-02-10 19:51:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:20,778 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3112 transitions. [2020-02-10 19:51:20,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3112 transitions. [2020-02-10 19:51:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:20,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:20,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:20,779 INFO L427 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash -573980041, now seen corresponding path program 802 times [2020-02-10 19:51:20,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:20,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574553066] [2020-02-10 19:51:20,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:21,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574553066] [2020-02-10 19:51:21,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:21,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:21,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636007056] [2020-02-10 19:51:21,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:21,151 INFO L87 Difference]: Start difference. First operand 782 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:51:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:21,291 INFO L93 Difference]: Finished difference Result 1238 states and 4369 transitions. [2020-02-10 19:51:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:21,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:21,294 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:51:21,294 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:51:21,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:51:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 19:51:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 19:51:21,316 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:21,316 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 19:51:21,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 19:51:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:21,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:21,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] [2020-02-10 19:51:21,317 INFO L427 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:21,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash 837730525, now seen corresponding path program 803 times [2020-02-10 19:51:21,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:21,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570168105] [2020-02-10 19:51:21,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:21,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570168105] [2020-02-10 19:51:21,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:21,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:21,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748386080] [2020-02-10 19:51:21,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:21,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:21,716 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:21,863 INFO L93 Difference]: Finished difference Result 1234 states and 4361 transitions. [2020-02-10 19:51:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:21,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:21,867 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 19:51:21,867 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 19:51:21,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 19:51:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 781. [2020-02-10 19:51:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 19:51:21,888 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 19:51:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:21,888 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 19:51:21,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 19:51:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:21,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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] [2020-02-10 19:51:21,889 INFO L427 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -235354855, now seen corresponding path program 804 times [2020-02-10 19:51:21,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:21,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711721125] [2020-02-10 19:51:21,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:22,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711721125] [2020-02-10 19:51:22,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:22,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:22,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097933384] [2020-02-10 19:51:22,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:22,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:22,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:22,250 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:51:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:22,376 INFO L93 Difference]: Finished difference Result 1236 states and 4362 transitions. [2020-02-10 19:51:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:22,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:22,380 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 19:51:22,380 INFO L226 Difference]: Without dead ends: 1216 [2020-02-10 19:51:22,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-02-10 19:51:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 775. [2020-02-10 19:51:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 19:51:22,402 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 19:51:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:22,402 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 19:51:22,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 19:51:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:22,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:22,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:22,403 INFO L427 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 370706525, now seen corresponding path program 805 times [2020-02-10 19:51:22,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:22,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435616085] [2020-02-10 19:51:22,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:22,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435616085] [2020-02-10 19:51:22,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:22,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:22,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879335215] [2020-02-10 19:51:22,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:22,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:22,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:22,764 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:51:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:22,899 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-02-10 19:51:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:22,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:22,903 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 19:51:22,903 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 19:51:22,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 19:51:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-02-10 19:51:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 19:51:22,924 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 19:51:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:22,924 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 19:51:22,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 19:51:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:22,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:22,925 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:22,925 INFO L427 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1361964347, now seen corresponding path program 806 times [2020-02-10 19:51:22,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:22,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364460127] [2020-02-10 19:51:22,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:23,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364460127] [2020-02-10 19:51:23,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:23,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:23,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448024564] [2020-02-10 19:51:23,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:23,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:23,291 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:51:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:23,435 INFO L93 Difference]: Finished difference Result 1250 states and 4398 transitions. [2020-02-10 19:51:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:23,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:23,438 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:51:23,438 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:51:23,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:51:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-02-10 19:51:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:51:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 19:51:23,460 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:23,460 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 19:51:23,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 19:51:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:23,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:23,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] [2020-02-10 19:51:23,462 INFO L427 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1998226693, now seen corresponding path program 807 times [2020-02-10 19:51:23,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:23,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21539455] [2020-02-10 19:51:23,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:23,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21539455] [2020-02-10 19:51:23,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:23,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:23,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375369537] [2020-02-10 19:51:23,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:23,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:23,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:23,820 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:23,964 INFO L93 Difference]: Finished difference Result 1245 states and 4388 transitions. [2020-02-10 19:51:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:23,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:23,968 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 19:51:23,968 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:51:23,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:51:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 19:51:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 19:51:23,989 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 19:51:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:23,989 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 19:51:23,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 19:51:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:23,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:23,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:23,991 INFO L427 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:23,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:23,991 INFO L82 PathProgramCache]: Analyzing trace with hash -996465767, now seen corresponding path program 808 times [2020-02-10 19:51:23,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:23,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300799320] [2020-02-10 19:51:23,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:24,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300799320] [2020-02-10 19:51:24,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:24,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:24,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735840089] [2020-02-10 19:51:24,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:24,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:24,350 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:51:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:24,491 INFO L93 Difference]: Finished difference Result 1246 states and 4386 transitions. [2020-02-10 19:51:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:24,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:24,494 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:51:24,494 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:51:24,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:51:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-02-10 19:51:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:51:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 19:51:24,516 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 19:51:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:24,516 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 19:51:24,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 19:51:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:24,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:24,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:24,518 INFO L427 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1943185315, now seen corresponding path program 809 times [2020-02-10 19:51:24,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:24,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271223403] [2020-02-10 19:51:24,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:24,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271223403] [2020-02-10 19:51:24,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:24,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:24,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808642395] [2020-02-10 19:51:24,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:24,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:24,885 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:51:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:25,026 INFO L93 Difference]: Finished difference Result 1252 states and 4399 transitions. [2020-02-10 19:51:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:25,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:25,030 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 19:51:25,030 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 19:51:25,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 19:51:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 784. [2020-02-10 19:51:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 19:51:25,052 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 19:51:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:25,052 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 19:51:25,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 19:51:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:25,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:25,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:25,053 INFO L427 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash -332244357, now seen corresponding path program 810 times [2020-02-10 19:51:25,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:25,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417689113] [2020-02-10 19:51:25,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:25,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417689113] [2020-02-10 19:51:25,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:25,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:25,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653307885] [2020-02-10 19:51:25,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:25,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:25,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:25,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:25,412 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:51:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:25,557 INFO L93 Difference]: Finished difference Result 1250 states and 4390 transitions. [2020-02-10 19:51:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:25,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:25,561 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:51:25,561 INFO L226 Difference]: Without dead ends: 1227 [2020-02-10 19:51:25,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-02-10 19:51:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 775. [2020-02-10 19:51:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:51:25,583 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:51:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:25,583 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:51:25,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:51:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:25,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:25,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:25,584 INFO L427 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1554195609, now seen corresponding path program 811 times [2020-02-10 19:51:25,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:25,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671816947] [2020-02-10 19:51:25,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:25,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671816947] [2020-02-10 19:51:25,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:25,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:25,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743907670] [2020-02-10 19:51:25,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:25,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:25,935 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:51:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:26,069 INFO L93 Difference]: Finished difference Result 1240 states and 4374 transitions. [2020-02-10 19:51:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:26,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:26,073 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:51:26,073 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:51:26,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:51:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-02-10 19:51:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 19:51:26,095 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 19:51:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:26,095 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 19:51:26,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 19:51:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:26,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:26,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:26,096 INFO L427 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1129830729, now seen corresponding path program 812 times [2020-02-10 19:51:26,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:26,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012879717] [2020-02-10 19:51:26,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:26,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 19:51:26,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012879717] [2020-02-10 19:51:26,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:26,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:26,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204031118] [2020-02-10 19:51:26,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:26,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:26,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:26,440 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:51:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:26,600 INFO L93 Difference]: Finished difference Result 1244 states and 4379 transitions. [2020-02-10 19:51:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:26,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:26,603 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:51:26,604 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:51:26,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:51:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 778. [2020-02-10 19:51:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-02-10 19:51:26,625 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-02-10 19:51:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:26,625 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-02-10 19:51:26,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-02-10 19:51:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:26,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:26,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:26,627 INFO L427 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -46242245, now seen corresponding path program 813 times [2020-02-10 19:51:26,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:26,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818226459] [2020-02-10 19:51:26,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:26,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818226459] [2020-02-10 19:51:26,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:26,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:26,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324017977] [2020-02-10 19:51:26,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:26,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:26,982 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:51:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:27,140 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-02-10 19:51:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:27,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:27,143 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:51:27,143 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:51:27,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:51:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 19:51:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 19:51:27,164 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 19:51:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:27,164 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 19:51:27,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 19:51:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:27,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:27,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:27,166 INFO L427 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1119327625, now seen corresponding path program 814 times [2020-02-10 19:51:27,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:27,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785064974] [2020-02-10 19:51:27,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:27,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785064974] [2020-02-10 19:51:27,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:27,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:27,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993076658] [2020-02-10 19:51:27,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:27,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:27,515 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:51:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:27,672 INFO L93 Difference]: Finished difference Result 1240 states and 4368 transitions. [2020-02-10 19:51:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:27,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:27,676 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:51:27,676 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:51:27,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:51:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 778. [2020-02-10 19:51:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:51:27,697 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:51:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:27,698 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:51:27,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:51:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:27,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:27,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] [2020-02-10 19:51:27,699 INFO L427 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:27,699 INFO L82 PathProgramCache]: Analyzing trace with hash -35739141, now seen corresponding path program 815 times [2020-02-10 19:51:27,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:27,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651266642] [2020-02-10 19:51:27,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:28,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 19:51:28,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651266642] [2020-02-10 19:51:28,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:28,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:28,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561131753] [2020-02-10 19:51:28,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:28,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:28,050 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:51:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:28,216 INFO L93 Difference]: Finished difference Result 1248 states and 4386 transitions. [2020-02-10 19:51:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:28,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:28,220 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:51:28,220 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:51:28,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:51:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 19:51:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 19:51:28,241 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:28,241 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 19:51:28,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 19:51:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:28,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:28,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] [2020-02-10 19:51:28,242 INFO L427 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1575201817, now seen corresponding path program 816 times [2020-02-10 19:51:28,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:28,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227964214] [2020-02-10 19:51:28,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:28,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 19:51:28,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227964214] [2020-02-10 19:51:28,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:28,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:28,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21915852] [2020-02-10 19:51:28,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:28,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:28,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:28,604 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:28,786 INFO L93 Difference]: Finished difference Result 1246 states and 4377 transitions. [2020-02-10 19:51:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:28,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:28,789 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:51:28,789 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 19:51:28,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 19:51:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 772. [2020-02-10 19:51:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 19:51:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3083 transitions. [2020-02-10 19:51:28,811 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3083 transitions. Word has length 25 [2020-02-10 19:51:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:28,811 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3083 transitions. [2020-02-10 19:51:28,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3083 transitions. [2020-02-10 19:51:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:28,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:28,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:28,812 INFO L427 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1296926015, now seen corresponding path program 817 times [2020-02-10 19:51:28,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:28,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229450448] [2020-02-10 19:51:28,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:29,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229450448] [2020-02-10 19:51:29,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:29,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:29,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355283720] [2020-02-10 19:51:29,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:29,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:29,171 INFO L87 Difference]: Start difference. First operand 772 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:51:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:29,323 INFO L93 Difference]: Finished difference Result 1250 states and 4406 transitions. [2020-02-10 19:51:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:29,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:29,327 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:51:29,327 INFO L226 Difference]: Without dead ends: 1235 [2020-02-10 19:51:29,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2020-02-10 19:51:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 781. [2020-02-10 19:51:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 19:51:29,349 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 19:51:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:29,349 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 19:51:29,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 19:51:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:29,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:29,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] [2020-02-10 19:51:29,350 INFO L427 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1387100323, now seen corresponding path program 818 times [2020-02-10 19:51:29,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:29,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683219034] [2020-02-10 19:51:29,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:29,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683219034] [2020-02-10 19:51:29,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:29,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:29,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626557808] [2020-02-10 19:51:29,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:29,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:29,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:29,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:29,723 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:51:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:29,851 INFO L93 Difference]: Finished difference Result 1247 states and 4397 transitions. [2020-02-10 19:51:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:29,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:29,855 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 19:51:29,855 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:51:29,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:51:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-02-10 19:51:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:51:29,877 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:29,877 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:51:29,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:51:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:29,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:29,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:29,878 INFO L427 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash -303511839, now seen corresponding path program 819 times [2020-02-10 19:51:29,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:29,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429994497] [2020-02-10 19:51:29,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:30,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429994497] [2020-02-10 19:51:30,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:30,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:30,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125634616] [2020-02-10 19:51:30,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:30,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:30,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:30,247 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:30,373 INFO L93 Difference]: Finished difference Result 1257 states and 4420 transitions. [2020-02-10 19:51:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:30,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:30,377 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 19:51:30,377 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:51:30,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:51:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 784. [2020-02-10 19:51:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-02-10 19:51:30,398 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-02-10 19:51:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:30,399 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-02-10 19:51:30,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-02-10 19:51:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:30,400 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:30,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:30,400 INFO L427 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1376597219, now seen corresponding path program 820 times [2020-02-10 19:51:30,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:30,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158799804] [2020-02-10 19:51:30,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:30,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158799804] [2020-02-10 19:51:30,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:30,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:30,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909560420] [2020-02-10 19:51:30,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:30,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:30,772 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:51:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:30,925 INFO L93 Difference]: Finished difference Result 1258 states and 4416 transitions. [2020-02-10 19:51:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:30,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:30,928 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 19:51:30,928 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 19:51:30,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 19:51:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 778. [2020-02-10 19:51:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 19:51:30,949 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:30,949 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 19:51:30,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 19:51:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:30,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:30,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:30,950 INFO L427 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:30,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash -293008735, now seen corresponding path program 821 times [2020-02-10 19:51:30,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:30,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093893925] [2020-02-10 19:51:30,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:31,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093893925] [2020-02-10 19:51:31,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:31,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:31,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548937243] [2020-02-10 19:51:31,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:31,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:31,327 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:31,454 INFO L93 Difference]: Finished difference Result 1248 states and 4396 transitions. [2020-02-10 19:51:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:31,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:31,457 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:51:31,457 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 19:51:31,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 19:51:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 781. [2020-02-10 19:51:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 19:51:31,479 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 19:51:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:31,479 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 19:51:31,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 19:51:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:31,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:31,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] [2020-02-10 19:51:31,481 INFO L427 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1317932223, now seen corresponding path program 822 times [2020-02-10 19:51:31,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:31,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802229245] [2020-02-10 19:51:31,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:31,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 19:51:31,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802229245] [2020-02-10 19:51:31,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:31,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:31,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815005507] [2020-02-10 19:51:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:31,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:31,839 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:51:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:31,994 INFO L93 Difference]: Finished difference Result 1252 states and 4401 transitions. [2020-02-10 19:51:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:31,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:31,997 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 19:51:31,998 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:51:31,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:51:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 775. [2020-02-10 19:51:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 19:51:32,019 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 19:51:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:32,020 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 19:51:32,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 19:51:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:32,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:32,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:32,021 INFO L427 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1072007203, now seen corresponding path program 823 times [2020-02-10 19:51:32,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:32,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228954613] [2020-02-10 19:51:32,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:32,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228954613] [2020-02-10 19:51:32,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:32,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:32,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140442365] [2020-02-10 19:51:32,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:32,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:32,378 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:51:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:32,511 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-02-10 19:51:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:32,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:32,514 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 19:51:32,514 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:51:32,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:51:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 19:51:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:51:32,535 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:51:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:32,535 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:51:32,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:51:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:32,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:32,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:32,537 INFO L427 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash 538933755, now seen corresponding path program 824 times [2020-02-10 19:51:32,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:32,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353787264] [2020-02-10 19:51:32,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:32,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353787264] [2020-02-10 19:51:32,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:32,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:32,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718455578] [2020-02-10 19:51:32,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:32,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:32,908 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:51:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,050 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 19:51:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:33,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,053 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:51:33,053 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 19:51:33,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 19:51:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-02-10 19:51:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 19:51:33,075 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,075 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 19:51:33,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 19:51:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:33,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:33,076 INFO L427 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,076 INFO L82 PathProgramCache]: Analyzing trace with hash 22084385, now seen corresponding path program 825 times [2020-02-10 19:51:33,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080759102] [2020-02-10 19:51:33,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:33,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080759102] [2020-02-10 19:51:33,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:33,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:33,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030391907] [2020-02-10 19:51:33,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:33,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:33,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:33,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:33,438 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,573 INFO L93 Difference]: Finished difference Result 1251 states and 4403 transitions. [2020-02-10 19:51:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:33,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,576 INFO L225 Difference]: With dead ends: 1251 [2020-02-10 19:51:33,576 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 19:51:33,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 19:51:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 783. [2020-02-10 19:51:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-02-10 19:51:33,598 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-02-10 19:51:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,598 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-02-10 19:51:33,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-02-10 19:51:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:33,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,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] [2020-02-10 19:51:33,599 INFO L427 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 559939963, now seen corresponding path program 826 times [2020-02-10 19:51:33,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137510887] [2020-02-10 19:51:33,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:33,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 19:51:33,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137510887] [2020-02-10 19:51:33,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:33,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:33,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140527515] [2020-02-10 19:51:33,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:33,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:33,984 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:51:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:34,112 INFO L93 Difference]: Finished difference Result 1250 states and 4396 transitions. [2020-02-10 19:51:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:34,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:34,115 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:51:34,115 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 19:51:34,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 19:51:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-02-10 19:51:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-02-10 19:51:34,137 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-02-10 19:51:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:34,137 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-02-10 19:51:34,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-02-10 19:51:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:34,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:34,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] [2020-02-10 19:51:34,138 INFO L427 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:34,138 INFO L82 PathProgramCache]: Analyzing trace with hash 32587489, now seen corresponding path program 827 times [2020-02-10 19:51:34,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:34,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112695299] [2020-02-10 19:51:34,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:34,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112695299] [2020-02-10 19:51:34,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:34,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:34,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568381623] [2020-02-10 19:51:34,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:34,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:34,492 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:51:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:34,628 INFO L93 Difference]: Finished difference Result 1243 states and 4382 transitions. [2020-02-10 19:51:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:34,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:34,631 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:51:34,631 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 19:51:34,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 19:51:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-02-10 19:51:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 19:51:34,652 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 19:51:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:34,652 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 19:51:34,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 19:51:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:34,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:34,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:34,654 INFO L427 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1040497891, now seen corresponding path program 828 times [2020-02-10 19:51:34,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:34,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225902319] [2020-02-10 19:51:34,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:35,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225902319] [2020-02-10 19:51:35,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:35,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:35,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069053036] [2020-02-10 19:51:35,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:35,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:35,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:35,010 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:51:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:35,142 INFO L93 Difference]: Finished difference Result 1245 states and 4383 transitions. [2020-02-10 19:51:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:35,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:35,146 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 19:51:35,146 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:51:35,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:51:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-02-10 19:51:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:51:35,168 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:51:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:35,168 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:51:35,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:51:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:35,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:35,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] [2020-02-10 19:51:35,169 INFO L427 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash -746410979, now seen corresponding path program 829 times [2020-02-10 19:51:35,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:35,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688232098] [2020-02-10 19:51:35,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:35,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688232098] [2020-02-10 19:51:35,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:35,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:35,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730314178] [2020-02-10 19:51:35,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:35,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:35,546 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:51:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:35,722 INFO L93 Difference]: Finished difference Result 1265 states and 4441 transitions. [2020-02-10 19:51:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:35,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:35,725 INFO L225 Difference]: With dead ends: 1265 [2020-02-10 19:51:35,726 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 19:51:35,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 19:51:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 786. [2020-02-10 19:51:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:51:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3121 transitions. [2020-02-10 19:51:35,747 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3121 transitions. Word has length 25 [2020-02-10 19:51:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:35,748 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3121 transitions. [2020-02-10 19:51:35,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3121 transitions. [2020-02-10 19:51:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:35,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:35,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] [2020-02-10 19:51:35,749 INFO L427 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:35,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1819496359, now seen corresponding path program 830 times [2020-02-10 19:51:35,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:35,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828949098] [2020-02-10 19:51:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828949098] [2020-02-10 19:51:36,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:36,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:36,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043410739] [2020-02-10 19:51:36,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:36,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:36,132 INFO L87 Difference]: Start difference. First operand 786 states and 3121 transitions. Second operand 10 states. [2020-02-10 19:51:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:36,309 INFO L93 Difference]: Finished difference Result 1266 states and 4437 transitions. [2020-02-10 19:51:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:36,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:36,313 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 19:51:36,313 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 19:51:36,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 19:51:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-02-10 19:51:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 19:51:36,335 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:36,335 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 19:51:36,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 19:51:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:36,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:36,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:36,336 INFO L427 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1948118463, now seen corresponding path program 831 times [2020-02-10 19:51:36,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:36,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299615315] [2020-02-10 19:51:36,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:36,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 19:51:36,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299615315] [2020-02-10 19:51:36,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:36,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:36,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175875601] [2020-02-10 19:51:36,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:36,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:36,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:36,699 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:36,834 INFO L93 Difference]: Finished difference Result 1262 states and 4429 transitions. [2020-02-10 19:51:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:36,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:36,838 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 19:51:36,838 INFO L226 Difference]: Without dead ends: 1247 [2020-02-10 19:51:36,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2020-02-10 19:51:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 785. [2020-02-10 19:51:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:51:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3114 transitions. [2020-02-10 19:51:36,872 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3114 transitions. Word has length 25 [2020-02-10 19:51:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:36,872 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3114 transitions. [2020-02-10 19:51:36,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3114 transitions. [2020-02-10 19:51:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:36,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:36,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:36,874 INFO L427 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1808993255, now seen corresponding path program 832 times [2020-02-10 19:51:36,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:36,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620968001] [2020-02-10 19:51:36,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:37,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620968001] [2020-02-10 19:51:37,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:37,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:37,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189251958] [2020-02-10 19:51:37,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:37,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:37,236 INFO L87 Difference]: Start difference. First operand 785 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:51:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:37,414 INFO L93 Difference]: Finished difference Result 1261 states and 4422 transitions. [2020-02-10 19:51:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:37,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:37,418 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 19:51:37,418 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:51:37,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:51:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 19:51:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 19:51:37,440 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 19:51:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:37,440 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 19:51:37,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 19:51:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:37,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:37,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] [2020-02-10 19:51:37,442 INFO L427 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1969124671, now seen corresponding path program 833 times [2020-02-10 19:51:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161295834] [2020-02-10 19:51:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:37,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161295834] [2020-02-10 19:51:37,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:37,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:37,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063204350] [2020-02-10 19:51:37,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:37,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:37,805 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:51:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:37,959 INFO L93 Difference]: Finished difference Result 1264 states and 4428 transitions. [2020-02-10 19:51:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:37,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:37,963 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 19:51:37,963 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 19:51:37,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 19:51:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-02-10 19:51:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:51:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3109 transitions. [2020-02-10 19:51:37,985 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3109 transitions. Word has length 25 [2020-02-10 19:51:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:37,985 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3109 transitions. [2020-02-10 19:51:37,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3109 transitions. [2020-02-10 19:51:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:37,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:37,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] [2020-02-10 19:51:37,986 INFO L427 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash -714901667, now seen corresponding path program 834 times [2020-02-10 19:51:37,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:37,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109794168] [2020-02-10 19:51:37,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:38,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109794168] [2020-02-10 19:51:38,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:38,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:38,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045937589] [2020-02-10 19:51:38,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:38,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:38,350 INFO L87 Difference]: Start difference. First operand 785 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:51:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:38,539 INFO L93 Difference]: Finished difference Result 1262 states and 4419 transitions. [2020-02-10 19:51:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:38,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:38,543 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 19:51:38,543 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 19:51:38,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 19:51:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 775. [2020-02-10 19:51:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3088 transitions. [2020-02-10 19:51:38,565 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3088 transitions. Word has length 25 [2020-02-10 19:51:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:38,565 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3088 transitions. [2020-02-10 19:51:38,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3088 transitions. [2020-02-10 19:51:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:38,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:38,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:38,566 INFO L427 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1190126203, now seen corresponding path program 835 times [2020-02-10 19:51:38,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:38,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29815681] [2020-02-10 19:51:38,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:38,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29815681] [2020-02-10 19:51:38,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:38,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:38,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888186758] [2020-02-10 19:51:38,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:38,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:38,908 INFO L87 Difference]: Start difference. First operand 775 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:51:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:39,078 INFO L93 Difference]: Finished difference Result 1246 states and 4388 transitions. [2020-02-10 19:51:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:39,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:39,081 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:51:39,081 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 19:51:39,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 19:51:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 781. [2020-02-10 19:51:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 19:51:39,103 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 19:51:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:39,103 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 19:51:39,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 19:51:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:39,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:39,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:39,104 INFO L427 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1493900135, now seen corresponding path program 836 times [2020-02-10 19:51:39,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:39,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063083755] [2020-02-10 19:51:39,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:39,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 19:51:39,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063083755] [2020-02-10 19:51:39,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:39,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:39,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498332052] [2020-02-10 19:51:39,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:39,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:39,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:39,454 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:51:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:39,629 INFO L93 Difference]: Finished difference Result 1250 states and 4393 transitions. [2020-02-10 19:51:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:39,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:39,632 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:51:39,632 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 19:51:39,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 19:51:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-02-10 19:51:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:51:39,653 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:51:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:39,653 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:51:39,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:51:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:39,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:39,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:39,654 INFO L427 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:39,655 INFO L82 PathProgramCache]: Analyzing trace with hash -410311651, now seen corresponding path program 837 times [2020-02-10 19:51:39,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:39,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153722438] [2020-02-10 19:51:39,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:40,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153722438] [2020-02-10 19:51:40,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:40,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:40,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83009447] [2020-02-10 19:51:40,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:40,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:40,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:40,043 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:51:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:40,221 INFO L93 Difference]: Finished difference Result 1244 states and 4381 transitions. [2020-02-10 19:51:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:40,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:40,225 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:51:40,225 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:51:40,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:51:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 19:51:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-02-10 19:51:40,247 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-02-10 19:51:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:40,247 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-02-10 19:51:40,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-02-10 19:51:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:40,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:40,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:40,248 INFO L427 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1483397031, now seen corresponding path program 838 times [2020-02-10 19:51:40,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:40,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938478211] [2020-02-10 19:51:40,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:40,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938478211] [2020-02-10 19:51:40,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:40,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:40,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761838362] [2020-02-10 19:51:40,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:40,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:40,601 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:51:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:40,778 INFO L93 Difference]: Finished difference Result 1246 states and 4382 transitions. [2020-02-10 19:51:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:40,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:40,782 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:51:40,782 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 19:51:40,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 19:51:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-02-10 19:51:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-02-10 19:51:40,803 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-02-10 19:51:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:40,804 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-02-10 19:51:40,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-02-10 19:51:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:40,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:40,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] [2020-02-10 19:51:40,805 INFO L427 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash -399808547, now seen corresponding path program 839 times [2020-02-10 19:51:40,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:40,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942240727] [2020-02-10 19:51:40,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:41,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942240727] [2020-02-10 19:51:41,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:41,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:41,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80659934] [2020-02-10 19:51:41,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:41,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:41,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:41,147 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:51:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:41,322 INFO L93 Difference]: Finished difference Result 1254 states and 4400 transitions. [2020-02-10 19:51:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:41,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:41,326 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 19:51:41,326 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 19:51:41,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 19:51:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-02-10 19:51:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-02-10 19:51:41,348 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:41,348 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-02-10 19:51:41,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-02-10 19:51:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:41,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:41,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] [2020-02-10 19:51:41,349 INFO L427 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1211132411, now seen corresponding path program 840 times [2020-02-10 19:51:41,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:41,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629961412] [2020-02-10 19:51:41,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:41,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 19:51:41,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629961412] [2020-02-10 19:51:41,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:41,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:41,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430506892] [2020-02-10 19:51:41,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:41,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:41,720 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:41,901 INFO L93 Difference]: Finished difference Result 1252 states and 4391 transitions. [2020-02-10 19:51:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:41,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:41,904 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 19:51:41,904 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:51:41,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:51:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 769. [2020-02-10 19:51:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 19:51:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3076 transitions. [2020-02-10 19:51:41,925 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3076 transitions. Word has length 25 [2020-02-10 19:51:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:41,925 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3076 transitions. [2020-02-10 19:51:41,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3076 transitions. [2020-02-10 19:51:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:41,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:41,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:41,927 INFO L427 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1423698301, now seen corresponding path program 841 times [2020-02-10 19:51:41,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:41,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549023030] [2020-02-10 19:51:41,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,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 19:51:42,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549023030] [2020-02-10 19:51:42,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:42,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791362906] [2020-02-10 19:51:42,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:42,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:42,272 INFO L87 Difference]: Start difference. First operand 769 states and 3076 transitions. Second operand 10 states. [2020-02-10 19:51:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:42,451 INFO L93 Difference]: Finished difference Result 1213 states and 4289 transitions. [2020-02-10 19:51:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:42,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:42,454 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:51:42,455 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:51:42,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:51:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 781. [2020-02-10 19:51:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 19:51:42,476 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 19:51:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:42,476 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 19:51:42,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 19:51:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:42,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:42,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:42,477 INFO L427 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash -453446687, now seen corresponding path program 842 times [2020-02-10 19:51:42,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:42,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231045259] [2020-02-10 19:51:42,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:42,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231045259] [2020-02-10 19:51:42,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:42,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534893051] [2020-02-10 19:51:42,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:42,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:42,820 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 19:51:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:42,967 INFO L93 Difference]: Finished difference Result 1215 states and 4289 transitions. [2020-02-10 19:51:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:42,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:42,971 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:51:42,971 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:51:42,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:51:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 19:51:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3109 transitions. [2020-02-10 19:51:42,992 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3109 transitions. Word has length 25 [2020-02-10 19:51:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:42,992 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3109 transitions. [2020-02-10 19:51:42,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3109 transitions. [2020-02-10 19:51:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:42,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:42,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:42,994 INFO L427 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash 502335777, now seen corresponding path program 843 times [2020-02-10 19:51:42,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:42,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698525837] [2020-02-10 19:51:42,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:43,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698525837] [2020-02-10 19:51:43,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:43,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:43,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37209252] [2020-02-10 19:51:43,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:43,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:43,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:43,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:43,360 INFO L87 Difference]: Start difference. First operand 777 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:51:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:43,539 INFO L93 Difference]: Finished difference Result 1209 states and 4277 transitions. [2020-02-10 19:51:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:43,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:43,542 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:51:43,543 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:51:43,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:51:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 19:51:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3114 transitions. [2020-02-10 19:51:43,564 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3114 transitions. Word has length 25 [2020-02-10 19:51:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:43,564 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3114 transitions. [2020-02-10 19:51:43,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3114 transitions. [2020-02-10 19:51:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:43,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:43,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:43,565 INFO L427 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1483090495, now seen corresponding path program 844 times [2020-02-10 19:51:43,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:43,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228059621] [2020-02-10 19:51:43,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:43,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228059621] [2020-02-10 19:51:43,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:43,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:43,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548805270] [2020-02-10 19:51:43,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:43,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:43,912 INFO L87 Difference]: Start difference. First operand 780 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:51:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,096 INFO L93 Difference]: Finished difference Result 1208 states and 4272 transitions. [2020-02-10 19:51:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:44,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,099 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:51:44,099 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:51:44,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:51:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 19:51:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3106 transitions. [2020-02-10 19:51:44,121 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3106 transitions. Word has length 25 [2020-02-10 19:51:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,121 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3106 transitions. [2020-02-10 19:51:44,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3106 transitions. [2020-02-10 19:51:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:44,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:44,122 INFO L427 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:44,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,123 INFO L82 PathProgramCache]: Analyzing trace with hash -114821501, now seen corresponding path program 845 times [2020-02-10 19:51:44,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049278847] [2020-02-10 19:51:44,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:44,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049278847] [2020-02-10 19:51:44,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:44,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:44,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376028877] [2020-02-10 19:51:44,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:44,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:44,467 INFO L87 Difference]: Start difference. First operand 777 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:51:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,610 INFO L93 Difference]: Finished difference Result 1213 states and 4282 transitions. [2020-02-10 19:51:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:44,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,614 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:51:44,614 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:51:44,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:51:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-02-10 19:51:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 19:51:44,636 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 19:51:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,636 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 19:51:44,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 19:51:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:44,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:44,637 INFO L427 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1496119457, now seen corresponding path program 846 times [2020-02-10 19:51:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203334307] [2020-02-10 19:51:44,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:45,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 19:51:45,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203334307] [2020-02-10 19:51:45,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:45,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:45,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336513370] [2020-02-10 19:51:45,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:45,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:45,002 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:51:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:45,146 INFO L93 Difference]: Finished difference Result 1210 states and 4273 transitions. [2020-02-10 19:51:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:45,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:45,150 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:51:45,150 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:51:45,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:51:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 774. [2020-02-10 19:51:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:51:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3098 transitions. [2020-02-10 19:51:45,171 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3098 transitions. Word has length 25 [2020-02-10 19:51:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:45,171 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3098 transitions. [2020-02-10 19:51:45,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3098 transitions. [2020-02-10 19:51:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:45,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:45,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:45,172 INFO L427 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1846184027, now seen corresponding path program 847 times [2020-02-10 19:51:45,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:45,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845042115] [2020-02-10 19:51:45,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:45,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845042115] [2020-02-10 19:51:45,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:45,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:45,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000548477] [2020-02-10 19:51:45,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:45,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:45,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:45,521 INFO L87 Difference]: Start difference. First operand 774 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:51:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:45,670 INFO L93 Difference]: Finished difference Result 1222 states and 4310 transitions. [2020-02-10 19:51:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:45,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:45,673 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:51:45,673 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 19:51:45,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 19:51:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-02-10 19:51:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:51:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3120 transitions. [2020-02-10 19:51:45,694 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3120 transitions. Word has length 25 [2020-02-10 19:51:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:45,694 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3120 transitions. [2020-02-10 19:51:45,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3120 transitions. [2020-02-10 19:51:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:45,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:45,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] [2020-02-10 19:51:45,696 INFO L427 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash -875932413, now seen corresponding path program 848 times [2020-02-10 19:51:45,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:45,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683230867] [2020-02-10 19:51:45,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:46,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683230867] [2020-02-10 19:51:46,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:46,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589252522] [2020-02-10 19:51:46,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:46,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:46,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:46,039 INFO L87 Difference]: Start difference. First operand 782 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:51:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:46,179 INFO L93 Difference]: Finished difference Result 1224 states and 4310 transitions. [2020-02-10 19:51:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:46,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:46,183 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 19:51:46,183 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 19:51:46,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 19:51:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 778. [2020-02-10 19:51:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3109 transitions. [2020-02-10 19:51:46,204 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3109 transitions. Word has length 25 [2020-02-10 19:51:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:46,204 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3109 transitions. [2020-02-10 19:51:46,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3109 transitions. [2020-02-10 19:51:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:46,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:46,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:46,206 INFO L427 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:46,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2005884129, now seen corresponding path program 849 times [2020-02-10 19:51:46,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:46,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643255736] [2020-02-10 19:51:46,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:46,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643255736] [2020-02-10 19:51:46,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:46,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859429058] [2020-02-10 19:51:46,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:46,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:46,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:46,552 INFO L87 Difference]: Start difference. First operand 778 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:51:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:46,732 INFO L93 Difference]: Finished difference Result 1223 states and 4308 transitions. [2020-02-10 19:51:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:46,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:46,736 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 19:51:46,736 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:51:46,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:51:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 782. [2020-02-10 19:51:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:51:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3116 transitions. [2020-02-10 19:51:46,777 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3116 transitions. Word has length 25 [2020-02-10 19:51:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:46,777 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3116 transitions. [2020-02-10 19:51:46,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3116 transitions. [2020-02-10 19:51:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:46,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:46,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:46,778 INFO L427 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825345, now seen corresponding path program 850 times [2020-02-10 19:51:46,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:46,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567727418] [2020-02-10 19:51:46,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:47,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567727418] [2020-02-10 19:51:47,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:47,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:47,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072119205] [2020-02-10 19:51:47,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:47,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:47,126 INFO L87 Difference]: Start difference. First operand 782 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:51:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,310 INFO L93 Difference]: Finished difference Result 1226 states and 4310 transitions. [2020-02-10 19:51:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:47,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,314 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:51:47,314 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:51:47,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:51:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 778. [2020-02-10 19:51:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:51:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 19:51:47,335 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,335 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 19:51:47,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 19:51:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:47,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:47,336 INFO L427 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash -211711003, now seen corresponding path program 851 times [2020-02-10 19:51:47,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707057508] [2020-02-10 19:51:47,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:47,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 19:51:47,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707057508] [2020-02-10 19:51:47,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:47,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:47,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111842286] [2020-02-10 19:51:47,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:47,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:47,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:47,687 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,827 INFO L93 Difference]: Finished difference Result 1229 states and 4318 transitions. [2020-02-10 19:51:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:47,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,831 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 19:51:47,831 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 19:51:47,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 19:51:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 784. [2020-02-10 19:51:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:51:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-02-10 19:51:47,853 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-02-10 19:51:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,853 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-02-10 19:51:47,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-02-10 19:51:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:47,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:47,854 INFO L427 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1284796383, now seen corresponding path program 852 times [2020-02-10 19:51:47,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639339219] [2020-02-10 19:51:47,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:48,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639339219] [2020-02-10 19:51:48,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:48,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:48,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361724775] [2020-02-10 19:51:48,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:48,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:48,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:48,201 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:51:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:48,329 INFO L93 Difference]: Finished difference Result 1230 states and 4314 transitions. [2020-02-10 19:51:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:48,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:48,333 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 19:51:48,333 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:51:48,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:51:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 774. [2020-02-10 19:51:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:51:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3095 transitions. [2020-02-10 19:51:48,354 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3095 transitions. Word has length 25 [2020-02-10 19:51:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:48,354 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3095 transitions. [2020-02-10 19:51:48,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3095 transitions. [2020-02-10 19:51:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:48,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:48,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:48,355 INFO L427 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash -342635675, now seen corresponding path program 853 times [2020-02-10 19:51:48,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:48,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768072420] [2020-02-10 19:51:48,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:48,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 19:51:48,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768072420] [2020-02-10 19:51:48,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:48,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:48,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108322800] [2020-02-10 19:51:48,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:48,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:48,720 INFO L87 Difference]: Start difference. First operand 774 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:51:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:48,854 INFO L93 Difference]: Finished difference Result 1210 states and 4276 transitions. [2020-02-10 19:51:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:48,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:48,857 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:51:48,858 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 19:51:48,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 19:51:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 780. [2020-02-10 19:51:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 19:51:48,879 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 19:51:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:48,879 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 19:51:48,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 19:51:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:48,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:48,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:48,881 INFO L427 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 638119043, now seen corresponding path program 854 times [2020-02-10 19:51:48,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:48,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139034213] [2020-02-10 19:51:48,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:49,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139034213] [2020-02-10 19:51:49,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:49,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:49,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635349604] [2020-02-10 19:51:49,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:49,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:49,226 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:51:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:49,370 INFO L93 Difference]: Finished difference Result 1209 states and 4271 transitions. [2020-02-10 19:51:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:49,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:49,374 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:51:49,374 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:51:49,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:51:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 19:51:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 19:51:49,395 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 19:51:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:49,395 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 19:51:49,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 19:51:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:49,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:49,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:49,397 INFO L427 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1583398403, now seen corresponding path program 855 times [2020-02-10 19:51:49,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:49,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353126108] [2020-02-10 19:51:49,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:49,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353126108] [2020-02-10 19:51:49,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:49,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:49,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525872144] [2020-02-10 19:51:49,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:49,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:49,738 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:51:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:49,864 INFO L93 Difference]: Finished difference Result 1215 states and 4284 transitions. [2020-02-10 19:51:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:49,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:49,867 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:51:49,867 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:51:49,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:51:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-02-10 19:51:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:51:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:51:49,888 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:51:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:49,888 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:51:49,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:51:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:49,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:49,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:49,889 INFO L427 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:49,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1720311071, now seen corresponding path program 856 times [2020-02-10 19:51:49,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:49,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016350129] [2020-02-10 19:51:49,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:50,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016350129] [2020-02-10 19:51:50,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:50,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:50,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889123925] [2020-02-10 19:51:50,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:50,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:50,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:50,234 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:51:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:50,359 INFO L93 Difference]: Finished difference Result 1218 states and 4286 transitions. [2020-02-10 19:51:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:50,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:50,363 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:51:50,363 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:51:50,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:51:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 19:51:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 19:51:50,406 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 19:51:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:50,406 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 19:51:50,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 19:51:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:50,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:50,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:50,407 INFO L427 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1302340453, now seen corresponding path program 857 times [2020-02-10 19:51:50,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:50,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636382340] [2020-02-10 19:51:50,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:50,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636382340] [2020-02-10 19:51:50,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:50,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:50,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856654727] [2020-02-10 19:51:50,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:50,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:50,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:50,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:50,754 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:51:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:50,877 INFO L93 Difference]: Finished difference Result 1212 states and 4274 transitions. [2020-02-10 19:51:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:50,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:50,880 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:51:50,881 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:51:50,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:51:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 780. [2020-02-10 19:51:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 19:51:50,902 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 19:51:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:50,903 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 19:51:50,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 19:51:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:50,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:50,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:50,904 INFO L427 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1381685885, now seen corresponding path program 858 times [2020-02-10 19:51:50,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:50,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380722433] [2020-02-10 19:51:50,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:51,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 19:51:51,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380722433] [2020-02-10 19:51:51,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:51,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:51,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826333765] [2020-02-10 19:51:51,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:51,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:51,252 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:51:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,384 INFO L93 Difference]: Finished difference Result 1216 states and 4279 transitions. [2020-02-10 19:51:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:51,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,388 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:51:51,388 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:51:51,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:51:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 774. [2020-02-10 19:51:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:51:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-02-10 19:51:51,409 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-02-10 19:51:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,409 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-02-10 19:51:51,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-02-10 19:51:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:51,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:51,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:51,411 INFO L427 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -998794271, now seen corresponding path program 859 times [2020-02-10 19:51:51,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658742401] [2020-02-10 19:51:51,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:51,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658742401] [2020-02-10 19:51:51,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:51,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:51,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321785566] [2020-02-10 19:51:51,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:51,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:51,755 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:51:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,881 INFO L93 Difference]: Finished difference Result 1218 states and 4291 transitions. [2020-02-10 19:51:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:51,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,884 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:51:51,884 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 19:51:51,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 19:51:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 780. [2020-02-10 19:51:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-02-10 19:51:51,905 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-02-10 19:51:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,905 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-02-10 19:51:51,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-02-10 19:51:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:51,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:51,907 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:51,907 INFO L427 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,907 INFO L82 PathProgramCache]: Analyzing trace with hash 612146687, now seen corresponding path program 860 times [2020-02-10 19:51:51,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29425875] [2020-02-10 19:51:51,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:52,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29425875] [2020-02-10 19:51:52,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:52,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:52,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781378724] [2020-02-10 19:51:52,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:52,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:52,251 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:51:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:52,400 INFO L93 Difference]: Finished difference Result 1215 states and 4282 transitions. [2020-02-10 19:51:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:52,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:52,403 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:51:52,403 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:51:52,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:51:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 777. [2020-02-10 19:51:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 19:51:52,425 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 19:51:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:52,425 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 19:51:52,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 19:51:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:52,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:52,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:52,426 INFO L427 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1695735171, now seen corresponding path program 861 times [2020-02-10 19:51:52,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:52,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153907696] [2020-02-10 19:51:52,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:52,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153907696] [2020-02-10 19:51:52,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:52,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:52,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266735099] [2020-02-10 19:51:52,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:52,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:52,778 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:51:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:52,898 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-02-10 19:51:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:52,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:52,901 INFO L225 Difference]: With dead ends: 1225 [2020-02-10 19:51:52,901 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:51:52,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:51:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 783. [2020-02-10 19:51:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:51:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-02-10 19:51:52,923 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-02-10 19:51:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:52,923 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-02-10 19:51:52,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-02-10 19:51:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:52,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:52,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:52,924 INFO L427 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 622649791, now seen corresponding path program 862 times [2020-02-10 19:51:52,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:52,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205939618] [2020-02-10 19:51:52,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:53,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 19:51:53,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205939618] [2020-02-10 19:51:53,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:53,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299549420] [2020-02-10 19:51:53,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:53,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:53,284 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:51:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:53,409 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 19:51:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:53,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:53,412 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:51:53,413 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:51:53,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:51:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 19:51:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 19:51:53,434 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 19:51:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:53,434 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 19:51:53,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 19:51:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:53,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:53,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:53,435 INFO L427 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:53,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1706238275, now seen corresponding path program 863 times [2020-02-10 19:51:53,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:53,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667542429] [2020-02-10 19:51:53,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:53,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667542429] [2020-02-10 19:51:53,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:53,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769065099] [2020-02-10 19:51:53,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:53,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:53,786 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:51:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:53,919 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 19:51:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:53,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:53,923 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:51:53,923 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:51:53,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:51:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-02-10 19:51:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 19:51:53,945 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:53,945 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 19:51:53,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 19:51:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:53,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:53,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:53,946 INFO L427 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:53,946 INFO L82 PathProgramCache]: Analyzing trace with hash -977788063, now seen corresponding path program 864 times [2020-02-10 19:51:53,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:53,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651482441] [2020-02-10 19:51:53,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:54,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651482441] [2020-02-10 19:51:54,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:54,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:54,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256903121] [2020-02-10 19:51:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:54,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:54,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:54,294 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:54,441 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-02-10 19:51:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:54,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:54,445 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:51:54,445 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:51:54,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:51:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 771. [2020-02-10 19:51:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:51:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3085 transitions. [2020-02-10 19:51:54,466 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3085 transitions. Word has length 25 [2020-02-10 19:51:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:54,466 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3085 transitions. [2020-02-10 19:51:54,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3085 transitions. [2020-02-10 19:51:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:54,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:54,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:54,467 INFO L427 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2060165155, now seen corresponding path program 865 times [2020-02-10 19:51:54,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:54,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407234455] [2020-02-10 19:51:54,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:54,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407234455] [2020-02-10 19:51:54,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:54,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:54,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529612107] [2020-02-10 19:51:54,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:54,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:54,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:54,811 INFO L87 Difference]: Start difference. First operand 771 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:51:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:54,938 INFO L93 Difference]: Finished difference Result 1196 states and 4235 transitions. [2020-02-10 19:51:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:54,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:54,941 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:51:54,941 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 19:51:54,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 19:51:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 780. [2020-02-10 19:51:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:51:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 19:51:54,962 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 19:51:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:54,962 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 19:51:54,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 19:51:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:54,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:54,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:54,963 INFO L427 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1089913541, now seen corresponding path program 866 times [2020-02-10 19:51:54,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:54,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090229280] [2020-02-10 19:51:54,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:55,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090229280] [2020-02-10 19:51:55,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:55,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:55,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210732891] [2020-02-10 19:51:55,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:55,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:55,302 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:51:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:55,427 INFO L93 Difference]: Finished difference Result 1198 states and 4235 transitions. [2020-02-10 19:51:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:55,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:55,431 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:51:55,431 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:51:55,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:51:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-02-10 19:51:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:51:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3102 transitions. [2020-02-10 19:51:55,451 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3102 transitions. Word has length 25 [2020-02-10 19:51:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,452 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3102 transitions. [2020-02-10 19:51:55,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3102 transitions. [2020-02-10 19:51:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:55,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:55,453 INFO L427 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash -134131077, now seen corresponding path program 867 times [2020-02-10 19:51:55,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413027979] [2020-02-10 19:51:55,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:55,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413027979] [2020-02-10 19:51:55,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:55,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:55,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114938742] [2020-02-10 19:51:55,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:55,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:55,797 INFO L87 Difference]: Start difference. First operand 776 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:51:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:55,922 INFO L93 Difference]: Finished difference Result 1192 states and 4223 transitions. [2020-02-10 19:51:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:55,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:55,925 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:51:55,925 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:51:55,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:51:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 19:51:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:51:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3107 transitions. [2020-02-10 19:51:55,947 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3107 transitions. Word has length 25 [2020-02-10 19:51:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,947 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3107 transitions. [2020-02-10 19:51:55,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3107 transitions. [2020-02-10 19:51:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:55,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:55,949 INFO L427 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 846623641, now seen corresponding path program 868 times [2020-02-10 19:51:55,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614728030] [2020-02-10 19:51:55,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:56,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614728030] [2020-02-10 19:51:56,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:56,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:56,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444185502] [2020-02-10 19:51:56,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:56,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:56,293 INFO L87 Difference]: Start difference. First operand 779 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:51:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:56,459 INFO L93 Difference]: Finished difference Result 1191 states and 4218 transitions. [2020-02-10 19:51:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:56,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:56,462 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:51:56,462 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:51:56,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:51:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 19:51:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:51:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3099 transitions. [2020-02-10 19:51:56,487 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3099 transitions. Word has length 25 [2020-02-10 19:51:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:56,487 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3099 transitions. [2020-02-10 19:51:56,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3099 transitions. [2020-02-10 19:51:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:56,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:56,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] [2020-02-10 19:51:56,489 INFO L427 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash -751288355, now seen corresponding path program 869 times [2020-02-10 19:51:56,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:56,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622284632] [2020-02-10 19:51:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:56,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 19:51:56,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622284632] [2020-02-10 19:51:56,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:56,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:56,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943049064] [2020-02-10 19:51:56,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:56,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:56,847 INFO L87 Difference]: Start difference. First operand 776 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:51:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:56,973 INFO L93 Difference]: Finished difference Result 1196 states and 4228 transitions. [2020-02-10 19:51:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:56,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:56,977 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:51:56,977 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:51:56,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:51:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 19:51:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:51:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 19:51:56,999 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 19:51:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:56,999 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 19:51:56,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 19:51:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:57,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:57,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:57,000 INFO L427 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash 859652603, now seen corresponding path program 870 times [2020-02-10 19:51:57,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:57,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826491549] [2020-02-10 19:51:57,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:57,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826491549] [2020-02-10 19:51:57,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:57,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:57,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171979537] [2020-02-10 19:51:57,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:57,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:57,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:57,345 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:51:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:57,486 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-02-10 19:51:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:57,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:57,490 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:51:57,490 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:51:57,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:51:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 19:51:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:51:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3092 transitions. [2020-02-10 19:51:57,511 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3092 transitions. Word has length 25 [2020-02-10 19:51:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:57,511 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3092 transitions. [2020-02-10 19:51:57,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3092 transitions. [2020-02-10 19:51:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:57,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:57,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] [2020-02-10 19:51:57,512 INFO L427 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash 544859237, now seen corresponding path program 871 times [2020-02-10 19:51:57,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:57,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218348553] [2020-02-10 19:51:57,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:57,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 19:51:57,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218348553] [2020-02-10 19:51:57,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:57,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:57,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128746868] [2020-02-10 19:51:57,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:57,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:57,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:57,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:57,844 INFO L87 Difference]: Start difference. First operand 773 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:51:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:57,991 INFO L93 Difference]: Finished difference Result 1192 states and 4221 transitions. [2020-02-10 19:51:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:57,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:57,994 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:51:57,994 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:51:57,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:51:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 19:51:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:51:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-02-10 19:51:58,016 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-02-10 19:51:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:58,016 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-02-10 19:51:58,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-02-10 19:51:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:58,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:58,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:58,017 INFO L427 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1515110851, now seen corresponding path program 872 times [2020-02-10 19:51:58,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:58,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699055231] [2020-02-10 19:51:58,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:58,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699055231] [2020-02-10 19:51:58,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:58,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:58,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973419194] [2020-02-10 19:51:58,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:58,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:58,361 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:51:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:58,491 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-02-10 19:51:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:58,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:58,494 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:51:58,494 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:51:58,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:51:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 19:51:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 19:51:58,516 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 19:51:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:58,516 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 19:51:58,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 19:51:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:58,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:58,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:58,518 INFO L427 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1585095035, now seen corresponding path program 873 times [2020-02-10 19:51:58,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:58,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287312475] [2020-02-10 19:51:58,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:58,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287312475] [2020-02-10 19:51:58,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:58,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:58,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122404155] [2020-02-10 19:51:58,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:58,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:58,880 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:51:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,006 INFO L93 Difference]: Finished difference Result 1186 states and 4205 transitions. [2020-02-10 19:51:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:59,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,009 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:51:59,010 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:51:59,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:51:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 19:51:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:51:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 19:51:59,030 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 19:51:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,030 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 19:51:59,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 19:51:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:59,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:59,032 INFO L427 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1687105127, now seen corresponding path program 874 times [2020-02-10 19:51:59,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177121651] [2020-02-10 19:51:59,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:59,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177121651] [2020-02-10 19:51:59,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:59,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:59,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972991520] [2020-02-10 19:51:59,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:59,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:59,371 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:51:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,502 INFO L93 Difference]: Finished difference Result 1184 states and 4199 transitions. [2020-02-10 19:51:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:59,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,506 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:51:59,506 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:51:59,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:51:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 19:51:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:51:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 19:51:59,527 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 19:51:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,527 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 19:51:59,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:51:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 19:51:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:51:59,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:59,529 INFO L427 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1138846363, now seen corresponding path program 875 times [2020-02-10 19:51:59,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062380624] [2020-02-10 19:51:59,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:59,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062380624] [2020-02-10 19:51:59,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:59,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:51:59,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44247911] [2020-02-10 19:51:59,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:51:59,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:51:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:51:59,861 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:51:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,987 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-02-10 19:51:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:51:59,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:51:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,990 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:51:59,990 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:51:59,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:52:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 19:52:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:52:00,011 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:00,012 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:52:00,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:52:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:00,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:00,013 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:00,013 INFO L427 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:00,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1674076165, now seen corresponding path program 876 times [2020-02-10 19:52:00,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:00,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211413068] [2020-02-10 19:52:00,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:00,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 19:52:00,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211413068] [2020-02-10 19:52:00,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401439940] [2020-02-10 19:52:00,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:00,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:00,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:00,351 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:00,482 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-02-10 19:52:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:00,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:00,486 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:52:00,486 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:52:00,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:52:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 19:52:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 19:52:00,507 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:00,507 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 19:52:00,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 19:52:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:00,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:00,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:00,508 INFO L427 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2048407589, now seen corresponding path program 877 times [2020-02-10 19:52:00,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:00,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018303869] [2020-02-10 19:52:00,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:00,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018303869] [2020-02-10 19:52:00,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:00,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:00,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949265204] [2020-02-10 19:52:00,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:00,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:00,889 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:52:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:01,023 INFO L93 Difference]: Finished difference Result 1184 states and 4201 transitions. [2020-02-10 19:52:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:01,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:01,028 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:52:01,028 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:52:01,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:52:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 778. [2020-02-10 19:52:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 19:52:01,049 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 19:52:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:01,049 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 19:52:01,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 19:52:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:01,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:01,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:01,051 INFO L427 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1265804989, now seen corresponding path program 878 times [2020-02-10 19:52:01,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:01,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064399956] [2020-02-10 19:52:01,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:01,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064399956] [2020-02-10 19:52:01,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:01,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:01,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320022922] [2020-02-10 19:52:01,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:01,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:01,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:01,403 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:52:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:01,539 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-02-10 19:52:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:01,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:01,542 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:52:01,543 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:52:01,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:52:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 19:52:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 19:52:01,563 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 19:52:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:01,563 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 19:52:01,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 19:52:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:01,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:01,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:01,565 INFO L427 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1162609309, now seen corresponding path program 879 times [2020-02-10 19:52:01,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:01,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126674535] [2020-02-10 19:52:01,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:01,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126674535] [2020-02-10 19:52:01,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:01,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:01,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112506945] [2020-02-10 19:52:01,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:01,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:01,914 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:52:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:02,044 INFO L93 Difference]: Finished difference Result 1182 states and 4194 transitions. [2020-02-10 19:52:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:02,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:02,047 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:52:02,047 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:52:02,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:52:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 19:52:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:52:02,068 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:02,068 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:52:02,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:52:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:02,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:02,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:02,069 INFO L427 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2109590853, now seen corresponding path program 880 times [2020-02-10 19:52:02,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:02,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98652331] [2020-02-10 19:52:02,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:02,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98652331] [2020-02-10 19:52:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:02,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332921386] [2020-02-10 19:52:02,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:02,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:02,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:02,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:02,412 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:02,546 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 19:52:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:02,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:02,550 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:52:02,550 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:52:02,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:52:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 19:52:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:52:02,572 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:02,572 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:52:02,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:52:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:02,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:02,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:02,573 INFO L427 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash 375205093, now seen corresponding path program 881 times [2020-02-10 19:52:02,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:02,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855734124] [2020-02-10 19:52:02,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:02,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855734124] [2020-02-10 19:52:02,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:02,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:02,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695294157] [2020-02-10 19:52:02,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:02,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:02,922 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:03,072 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 19:52:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:03,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:03,075 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:52:03,075 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:52:03,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:52:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 19:52:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:52:03,096 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,096 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:52:03,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:52:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:03,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:03,098 INFO L427 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:03,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1770965667, now seen corresponding path program 882 times [2020-02-10 19:52:03,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554214185] [2020-02-10 19:52:03,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:03,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 19:52:03,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554214185] [2020-02-10 19:52:03,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:03,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:03,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256099377] [2020-02-10 19:52:03,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:03,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:03,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:03,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:03,454 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:03,592 INFO L93 Difference]: Finished difference Result 1179 states and 4184 transitions. [2020-02-10 19:52:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:03,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:03,595 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:52:03,595 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:52:03,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:52:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 773. [2020-02-10 19:52:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 19:52:03,616 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 19:52:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,617 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 19:52:03,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 19:52:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:03,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:03,618 INFO L427 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1419583365, now seen corresponding path program 883 times [2020-02-10 19:52:03,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213793383] [2020-02-10 19:52:03,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:03,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213793383] [2020-02-10 19:52:03,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:03,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:03,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920697610] [2020-02-10 19:52:03,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:03,963 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:52:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:04,089 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-02-10 19:52:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:04,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:04,092 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:52:04,092 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:52:04,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:52:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 778. [2020-02-10 19:52:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 19:52:04,113 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 19:52:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:04,113 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 19:52:04,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 19:52:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:04,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:04,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:04,114 INFO L427 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash 191357593, now seen corresponding path program 884 times [2020-02-10 19:52:04,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:04,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739579695] [2020-02-10 19:52:04,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:04,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 19:52:04,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739579695] [2020-02-10 19:52:04,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:04,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:04,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866624116] [2020-02-10 19:52:04,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:04,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:04,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:04,470 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:52:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:04,619 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 19:52:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:04,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:04,622 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:52:04,622 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:52:04,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:52:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-02-10 19:52:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:52:04,644 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:04,644 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:52:04,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:52:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:04,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:04,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:04,645 INFO L427 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:04,645 INFO L82 PathProgramCache]: Analyzing trace with hash 768599811, now seen corresponding path program 885 times [2020-02-10 19:52:04,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:04,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539228246] [2020-02-10 19:52:04,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:04,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 19:52:04,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539228246] [2020-02-10 19:52:04,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:04,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:04,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526012623] [2020-02-10 19:52:04,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:04,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:04,992 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:05,121 INFO L93 Difference]: Finished difference Result 1188 states and 4204 transitions. [2020-02-10 19:52:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:05,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:05,125 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:52:05,125 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:52:05,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:52:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 19:52:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:52:05,146 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:05,146 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:52:05,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:52:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:05,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:05,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:05,148 INFO L427 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash 233370009, now seen corresponding path program 886 times [2020-02-10 19:52:05,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:05,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635920941] [2020-02-10 19:52:05,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:05,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635920941] [2020-02-10 19:52:05,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:05,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:05,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323455431] [2020-02-10 19:52:05,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:05,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:05,511 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:05,641 INFO L93 Difference]: Finished difference Result 1184 states and 4194 transitions. [2020-02-10 19:52:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:05,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:05,644 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:52:05,645 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:52:05,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:52:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 19:52:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:52:05,666 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:52:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:05,666 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:52:05,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:52:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:05,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:05,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:05,667 INFO L427 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 779102915, now seen corresponding path program 887 times [2020-02-10 19:52:05,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:05,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769411947] [2020-02-10 19:52:05,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:06,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769411947] [2020-02-10 19:52:06,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:06,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:06,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188906075] [2020-02-10 19:52:06,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:06,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:06,020 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:52:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:06,146 INFO L93 Difference]: Finished difference Result 1182 states and 4190 transitions. [2020-02-10 19:52:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:06,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:06,150 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:52:06,150 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:52:06,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:52:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:52:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:52:06,172 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:06,172 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:52:06,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:52:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:06,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:06,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] [2020-02-10 19:52:06,173 INFO L427 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1367067845, now seen corresponding path program 888 times [2020-02-10 19:52:06,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:06,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288965668] [2020-02-10 19:52:06,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:06,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 19:52:06,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288965668] [2020-02-10 19:52:06,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:06,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:06,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715685175] [2020-02-10 19:52:06,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:06,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:06,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:06,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:06,529 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:06,663 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 19:52:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:06,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:06,666 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:52:06,666 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:52:06,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:52:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 771. [2020-02-10 19:52:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:52:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-02-10 19:52:06,687 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-02-10 19:52:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:06,687 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-02-10 19:52:06,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-02-10 19:52:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:06,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:06,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:06,689 INFO L427 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1600160797, now seen corresponding path program 889 times [2020-02-10 19:52:06,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:06,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566528095] [2020-02-10 19:52:06,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:07,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 19:52:07,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566528095] [2020-02-10 19:52:07,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:07,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:07,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653460669] [2020-02-10 19:52:07,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:07,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:07,031 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:52:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:07,175 INFO L93 Difference]: Finished difference Result 1214 states and 4281 transitions. [2020-02-10 19:52:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:07,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:07,179 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:52:07,179 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 19:52:07,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 19:52:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 781. [2020-02-10 19:52:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:52:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3114 transitions. [2020-02-10 19:52:07,200 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3114 transitions. Word has length 25 [2020-02-10 19:52:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:07,200 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3114 transitions. [2020-02-10 19:52:07,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3114 transitions. [2020-02-10 19:52:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:07,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:07,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:07,201 INFO L427 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1724554885, now seen corresponding path program 890 times [2020-02-10 19:52:07,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:07,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240172613] [2020-02-10 19:52:07,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:07,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240172613] [2020-02-10 19:52:07,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:07,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:07,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140265520] [2020-02-10 19:52:07,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:07,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:07,537 INFO L87 Difference]: Start difference. First operand 781 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:52:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:07,708 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 19:52:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:07,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:07,712 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:52:07,712 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 19:52:07,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 19:52:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 777. [2020-02-10 19:52:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 19:52:07,732 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 19:52:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:07,732 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 19:52:07,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 19:52:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:07,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:07,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:07,734 INFO L427 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1157261657, now seen corresponding path program 891 times [2020-02-10 19:52:07,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:07,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283841921] [2020-02-10 19:52:07,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:08,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283841921] [2020-02-10 19:52:08,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:08,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:08,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865343821] [2020-02-10 19:52:08,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:08,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:08,058 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:52:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:08,184 INFO L93 Difference]: Finished difference Result 1215 states and 4279 transitions. [2020-02-10 19:52:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:08,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:08,188 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:52:08,188 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:52:08,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:52:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-02-10 19:52:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:52:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:52:08,209 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:52:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:08,209 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:52:08,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:52:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:08,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:08,210 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:08,211 INFO L427 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2146447817, now seen corresponding path program 892 times [2020-02-10 19:52:08,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:08,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333649626] [2020-02-10 19:52:08,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:08,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333649626] [2020-02-10 19:52:08,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:08,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:08,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563939097] [2020-02-10 19:52:08,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:08,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:08,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:08,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:08,544 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:52:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:08,676 INFO L93 Difference]: Finished difference Result 1218 states and 4281 transitions. [2020-02-10 19:52:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:08,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:08,679 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:52:08,679 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:52:08,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:52:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 19:52:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-02-10 19:52:08,701 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-02-10 19:52:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:08,701 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-02-10 19:52:08,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-02-10 19:52:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:08,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:08,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:08,702 INFO L427 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:08,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1060333475, now seen corresponding path program 893 times [2020-02-10 19:52:08,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:08,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120586095] [2020-02-10 19:52:08,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:09,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120586095] [2020-02-10 19:52:09,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:09,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435380711] [2020-02-10 19:52:09,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:09,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:09,030 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:52:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:09,156 INFO L93 Difference]: Finished difference Result 1221 states and 4289 transitions. [2020-02-10 19:52:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:09,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:09,159 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 19:52:09,159 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:52:09,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:52:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-02-10 19:52:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:52:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-02-10 19:52:09,181 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-02-10 19:52:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:09,181 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-02-10 19:52:09,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-02-10 19:52:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:09,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:09,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:09,182 INFO L427 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2133418855, now seen corresponding path program 894 times [2020-02-10 19:52:09,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:09,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589723746] [2020-02-10 19:52:09,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,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 19:52:09,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589723746] [2020-02-10 19:52:09,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:09,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461785956] [2020-02-10 19:52:09,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:09,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:09,529 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:52:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:09,660 INFO L93 Difference]: Finished difference Result 1222 states and 4285 transitions. [2020-02-10 19:52:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:09,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:09,663 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:52:09,664 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:52:09,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:52:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 773. [2020-02-10 19:52:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 19:52:09,685 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:09,686 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 19:52:09,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 19:52:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:09,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:09,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:09,687 INFO L427 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash 332703619, now seen corresponding path program 895 times [2020-02-10 19:52:09,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:09,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581289245] [2020-02-10 19:52:09,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:10,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581289245] [2020-02-10 19:52:10,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:10,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236347641] [2020-02-10 19:52:10,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:10,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:10,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:10,032 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:52:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:10,161 INFO L93 Difference]: Finished difference Result 1201 states and 4243 transitions. [2020-02-10 19:52:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:10,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:10,165 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:52:10,165 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:52:10,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:52:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-02-10 19:52:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 19:52:10,187 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 19:52:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:10,187 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 19:52:10,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 19:52:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:10,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:10,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:10,188 INFO L427 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1302955233, now seen corresponding path program 896 times [2020-02-10 19:52:10,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:10,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164331835] [2020-02-10 19:52:10,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:10,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164331835] [2020-02-10 19:52:10,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796399174] [2020-02-10 19:52:10,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:10,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:10,510 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:52:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:10,642 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-02-10 19:52:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:10,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:10,645 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:52:10,645 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:52:10,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:52:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-02-10 19:52:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 19:52:10,666 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 19:52:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:10,666 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 19:52:10,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 19:52:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:10,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:10,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:10,667 INFO L427 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1372939417, now seen corresponding path program 897 times [2020-02-10 19:52:10,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:10,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561758267] [2020-02-10 19:52:10,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:10,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 19:52:10,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561758267] [2020-02-10 19:52:10,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:10,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812540274] [2020-02-10 19:52:10,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:10,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:10,987 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:52:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,111 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-02-10 19:52:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:11,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,114 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:52:11,115 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:52:11,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:52:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 19:52:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:52:11,136 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,136 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:52:11,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:52:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:11,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:11,137 INFO L427 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1899260745, now seen corresponding path program 898 times [2020-02-10 19:52:11,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572015357] [2020-02-10 19:52:11,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:11,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 19:52:11,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572015357] [2020-02-10 19:52:11,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:11,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:11,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100979948] [2020-02-10 19:52:11,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:11,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:11,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:11,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:11,488 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,624 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 19:52:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:11,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,627 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:52:11,627 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:52:11,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:52:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-02-10 19:52:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:52:11,649 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,649 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:52:11,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:52:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:11,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:11,651 INFO L427 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1351001981, now seen corresponding path program 899 times [2020-02-10 19:52:11,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843339528] [2020-02-10 19:52:11,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:11,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843339528] [2020-02-10 19:52:11,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:11,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:11,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821412097] [2020-02-10 19:52:11,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:11,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:11,972 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:12,135 INFO L93 Difference]: Finished difference Result 1199 states and 4233 transitions. [2020-02-10 19:52:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:12,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:12,138 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 19:52:12,139 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:52:12,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:52:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 19:52:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:52:12,160 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:12,160 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:52:12,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:52:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:12,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:12,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:12,161 INFO L427 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:12,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1886231783, now seen corresponding path program 900 times [2020-02-10 19:52:12,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:12,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154021104] [2020-02-10 19:52:12,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:12,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 19:52:12,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154021104] [2020-02-10 19:52:12,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:12,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:12,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492602045] [2020-02-10 19:52:12,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:12,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:12,497 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:12,627 INFO L93 Difference]: Finished difference Result 1195 states and 4223 transitions. [2020-02-10 19:52:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:12,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:12,630 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:52:12,630 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:52:12,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:52:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 773. [2020-02-10 19:52:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 19:52:12,651 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 19:52:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:12,651 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 19:52:12,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 19:52:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:12,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:12,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:12,653 INFO L427 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash -955166973, now seen corresponding path program 901 times [2020-02-10 19:52:12,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:12,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809653448] [2020-02-10 19:52:12,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:12,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809653448] [2020-02-10 19:52:12,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:12,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:12,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47145629] [2020-02-10 19:52:12,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:12,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:12,978 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:52:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:13,127 INFO L93 Difference]: Finished difference Result 1203 states and 4245 transitions. [2020-02-10 19:52:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:13,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:13,130 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:52:13,131 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:52:13,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:52:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 779. [2020-02-10 19:52:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:52:13,152 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:52:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:13,152 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:52:13,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:52:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:13,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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] [2020-02-10 19:52:13,154 INFO L427 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash 36090849, now seen corresponding path program 902 times [2020-02-10 19:52:13,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:13,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608837371] [2020-02-10 19:52:13,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:13,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608837371] [2020-02-10 19:52:13,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:13,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:13,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038997627] [2020-02-10 19:52:13,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:13,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:13,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:13,485 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:52:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:13,617 INFO L93 Difference]: Finished difference Result 1206 states and 4247 transitions. [2020-02-10 19:52:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:13,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:13,620 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:52:13,620 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:13,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 775. [2020-02-10 19:52:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:52:13,642 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:13,642 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:52:13,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:52:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:13,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:13,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:13,643 INFO L427 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 527967965, now seen corresponding path program 903 times [2020-02-10 19:52:13,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:13,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563420355] [2020-02-10 19:52:13,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:13,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563420355] [2020-02-10 19:52:13,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:13,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:13,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905341585] [2020-02-10 19:52:13,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:13,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:13,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:13,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:13,971 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:14,103 INFO L93 Difference]: Finished difference Result 1196 states and 4227 transitions. [2020-02-10 19:52:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:14,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:14,106 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:52:14,106 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 19:52:14,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 19:52:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-02-10 19:52:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:52:14,127 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:14,127 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:52:14,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:52:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:14,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:14,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:14,128 INFO L427 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1550735099, now seen corresponding path program 904 times [2020-02-10 19:52:14,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:14,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766251879] [2020-02-10 19:52:14,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:14,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766251879] [2020-02-10 19:52:14,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:14,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110862714] [2020-02-10 19:52:14,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:14,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:14,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:14,451 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:14,582 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-02-10 19:52:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:14,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:14,585 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:52:14,585 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:52:14,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:52:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 19:52:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:52:14,605 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:52:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:14,605 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:52:14,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:52:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:14,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:14,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:14,607 INFO L427 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:14,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:14,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1677100931, now seen corresponding path program 905 times [2020-02-10 19:52:14,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:14,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309017389] [2020-02-10 19:52:14,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,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 19:52:14,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309017389] [2020-02-10 19:52:14,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:14,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259056074] [2020-02-10 19:52:14,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:14,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:14,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:14,958 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:52:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,107 INFO L93 Difference]: Finished difference Result 1202 states and 4237 transitions. [2020-02-10 19:52:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:15,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,110 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:52:15,110 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:15,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 19:52:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:52:15,132 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,132 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:52:15,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:52:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:15,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:15,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:15,133 INFO L427 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2080010787, now seen corresponding path program 906 times [2020-02-10 19:52:15,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:15,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978875567] [2020-02-10 19:52:15,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:15,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978875567] [2020-02-10 19:52:15,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:15,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:15,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137189470] [2020-02-10 19:52:15,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:15,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:15,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:15,460 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,612 INFO L93 Difference]: Finished difference Result 1197 states and 4225 transitions. [2020-02-10 19:52:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:15,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,616 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:52:15,616 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:52:15,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:52:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 19:52:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:52:15,637 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:52:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,638 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:52:15,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:52:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:15,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:15,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] [2020-02-10 19:52:15,639 INFO L427 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1728628485, now seen corresponding path program 907 times [2020-02-10 19:52:15,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:15,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270217358] [2020-02-10 19:52:15,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:15,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270217358] [2020-02-10 19:52:15,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:15,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:15,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726774538] [2020-02-10 19:52:15,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:15,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:15,965 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:52:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:16,093 INFO L93 Difference]: Finished difference Result 1213 states and 4267 transitions. [2020-02-10 19:52:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:16,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:16,097 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:52:16,097 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:52:16,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:52:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 19:52:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:52:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 19:52:16,118 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 19:52:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:16,119 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 19:52:16,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 19:52:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:16,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:16,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:16,120 INFO L427 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1493253431, now seen corresponding path program 908 times [2020-02-10 19:52:16,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:16,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513457838] [2020-02-10 19:52:16,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:16,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513457838] [2020-02-10 19:52:16,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:16,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:16,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554267015] [2020-02-10 19:52:16,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:16,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:16,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:16,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:16,446 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:52:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:16,574 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 19:52:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:16,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:16,577 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:52:16,577 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:52:16,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:52:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 19:52:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:52:16,598 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:52:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:16,598 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:52:16,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:52:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:16,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:16,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] [2020-02-10 19:52:16,599 INFO L427 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2059992545, now seen corresponding path program 909 times [2020-02-10 19:52:16,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:16,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246281051] [2020-02-10 19:52:16,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:16,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246281051] [2020-02-10 19:52:16,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:16,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:16,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836878272] [2020-02-10 19:52:16,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:16,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:16,912 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:52:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:17,054 INFO L93 Difference]: Finished difference Result 1204 states and 4243 transitions. [2020-02-10 19:52:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:17,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:17,058 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:52:17,058 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:52:17,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:52:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-02-10 19:52:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:52:17,079 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:17,079 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:52:17,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:52:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:17,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:17,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:17,080 INFO L427 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1524762743, now seen corresponding path program 910 times [2020-02-10 19:52:17,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:17,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673908935] [2020-02-10 19:52:17,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:17,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673908935] [2020-02-10 19:52:17,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:17,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:17,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879392957] [2020-02-10 19:52:17,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:17,419 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:17,567 INFO L93 Difference]: Finished difference Result 1200 states and 4233 transitions. [2020-02-10 19:52:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:17,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:17,571 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:52:17,571 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 19:52:17,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 19:52:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-02-10 19:52:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:52:17,594 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:52:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:17,594 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:52:17,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:52:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:17,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:17,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:17,595 INFO L427 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2080998753, now seen corresponding path program 911 times [2020-02-10 19:52:17,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:17,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654196557] [2020-02-10 19:52:17,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:17,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654196557] [2020-02-10 19:52:17,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:17,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:17,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636965163] [2020-02-10 19:52:17,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:17,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:17,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:17,918 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:52:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:18,045 INFO L93 Difference]: Finished difference Result 1206 states and 4245 transitions. [2020-02-10 19:52:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:18,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:18,049 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:52:18,049 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:52:18,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:52:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:52:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:52:18,070 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:52:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:18,070 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:52:18,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:52:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:18,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:18,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:18,072 INFO L427 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:18,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1676112965, now seen corresponding path program 912 times [2020-02-10 19:52:18,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:18,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595780770] [2020-02-10 19:52:18,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:18,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595780770] [2020-02-10 19:52:18,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:18,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981365132] [2020-02-10 19:52:18,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:18,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:18,398 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:52:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:18,546 INFO L93 Difference]: Finished difference Result 1201 states and 4233 transitions. [2020-02-10 19:52:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:18,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:18,550 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:52:18,550 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:52:18,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:52:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-02-10 19:52:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:52:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 19:52:18,571 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 19:52:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:18,571 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 19:52:18,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 19:52:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:18,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:18,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:18,572 INFO L427 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1403413765, now seen corresponding path program 913 times [2020-02-10 19:52:18,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:18,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277463727] [2020-02-10 19:52:18,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,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 19:52:18,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277463727] [2020-02-10 19:52:18,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:18,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510771145] [2020-02-10 19:52:18,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:18,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:18,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:18,919 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:52:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,057 INFO L93 Difference]: Finished difference Result 1194 states and 4226 transitions. [2020-02-10 19:52:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:19,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,060 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:52:19,060 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:52:19,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:52:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 19:52:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-02-10 19:52:19,082 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-02-10 19:52:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,082 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-02-10 19:52:19,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-02-10 19:52:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:19,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:19,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:19,083 INFO L427 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash -422659047, now seen corresponding path program 914 times [2020-02-10 19:52:19,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812784152] [2020-02-10 19:52:19,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:19,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812784152] [2020-02-10 19:52:19,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:19,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:19,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437224541] [2020-02-10 19:52:19,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:19,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:19,437 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:52:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,586 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 19:52:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:19,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:19,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,589 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:52:19,589 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:19,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 776. [2020-02-10 19:52:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:52:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3098 transitions. [2020-02-10 19:52:19,610 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,610 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3098 transitions. [2020-02-10 19:52:19,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3098 transitions. [2020-02-10 19:52:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:19,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:19,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:19,611 INFO L427 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash 522620313, now seen corresponding path program 915 times [2020-02-10 19:52:19,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614241503] [2020-02-10 19:52:19,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:19,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614241503] [2020-02-10 19:52:19,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:19,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:19,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839265108] [2020-02-10 19:52:19,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:19,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:19,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:19,977 INFO L87 Difference]: Start difference. First operand 776 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:20,102 INFO L93 Difference]: Finished difference Result 1199 states and 4234 transitions. [2020-02-10 19:52:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:20,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:20,106 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 19:52:20,106 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:20,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 19:52:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 19:52:20,127 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 19:52:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:20,127 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 19:52:20,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 19:52:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:20,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:20,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:20,128 INFO L427 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1513878135, now seen corresponding path program 916 times [2020-02-10 19:52:20,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:20,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029413661] [2020-02-10 19:52:20,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:20,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029413661] [2020-02-10 19:52:20,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:20,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:20,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38918576] [2020-02-10 19:52:20,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:20,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:20,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:20,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:20,479 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:52:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:20,609 INFO L93 Difference]: Finished difference Result 1202 states and 4236 transitions. [2020-02-10 19:52:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:20,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:20,612 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:52:20,612 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:52:20,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:52:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 776. [2020-02-10 19:52:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:52:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3095 transitions. [2020-02-10 19:52:20,634 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3095 transitions. Word has length 25 [2020-02-10 19:52:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:20,634 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3095 transitions. [2020-02-10 19:52:20,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3095 transitions. [2020-02-10 19:52:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:20,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:20,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:20,635 INFO L427 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 241562363, now seen corresponding path program 917 times [2020-02-10 19:52:20,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:20,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364718890] [2020-02-10 19:52:20,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:20,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 19:52:20,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364718890] [2020-02-10 19:52:20,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:20,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:20,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023303192] [2020-02-10 19:52:20,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:20,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:20,982 INFO L87 Difference]: Start difference. First operand 776 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:52:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:21,109 INFO L93 Difference]: Finished difference Result 1196 states and 4224 transitions. [2020-02-10 19:52:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:21,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:21,112 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:52:21,112 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:52:21,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:52:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-02-10 19:52:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 19:52:21,134 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 19:52:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:21,134 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 19:52:21,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 19:52:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:21,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:21,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:21,135 INFO L427 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1852503321, now seen corresponding path program 918 times [2020-02-10 19:52:21,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:21,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463626202] [2020-02-10 19:52:21,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:21,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 19:52:21,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463626202] [2020-02-10 19:52:21,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:21,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:21,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593071335] [2020-02-10 19:52:21,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:21,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:21,483 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:52:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:21,620 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 19:52:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:21,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:21,623 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:52:21,624 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:21,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 19:52:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 19:52:21,645 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 19:52:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:21,645 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 19:52:21,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 19:52:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:21,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:21,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:21,646 INFO L427 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1624096353, now seen corresponding path program 919 times [2020-02-10 19:52:21,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:21,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605968024] [2020-02-10 19:52:21,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:22,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605968024] [2020-02-10 19:52:22,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:22,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305630902] [2020-02-10 19:52:22,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:22,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:22,000 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:52:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:22,129 INFO L93 Difference]: Finished difference Result 1185 states and 4201 transitions. [2020-02-10 19:52:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:22,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:22,133 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 19:52:22,133 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:52:22,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:52:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 19:52:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 19:52:22,154 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 19:52:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:22,154 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 19:52:22,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 19:52:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:22,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:22,155 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:22,156 INFO L427 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1690116225, now seen corresponding path program 920 times [2020-02-10 19:52:22,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:22,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902341543] [2020-02-10 19:52:22,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:22,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902341543] [2020-02-10 19:52:22,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:22,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192549653] [2020-02-10 19:52:22,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:22,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:22,532 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:52:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:22,658 INFO L93 Difference]: Finished difference Result 1184 states and 4196 transitions. [2020-02-10 19:52:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:22,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:22,662 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:52:22,662 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:52:22,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:52:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 19:52:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:52:22,683 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:22,683 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:52:22,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:52:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:22,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:22,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] [2020-02-10 19:52:22,685 INFO L427 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash 738298073, now seen corresponding path program 921 times [2020-02-10 19:52:22,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:22,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246715250] [2020-02-10 19:52:22,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:23,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 19:52:23,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246715250] [2020-02-10 19:52:23,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:23,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:23,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050197124] [2020-02-10 19:52:23,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:23,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:23,033 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:23,161 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-02-10 19:52:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:23,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:23,164 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:52:23,164 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:52:23,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:52:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:52:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:52:23,185 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:23,185 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:52:23,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:52:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:23,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:23,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:23,186 INFO L427 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1761065207, now seen corresponding path program 922 times [2020-02-10 19:52:23,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:23,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392445010] [2020-02-10 19:52:23,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:23,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 19:52:23,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392445010] [2020-02-10 19:52:23,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:23,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:23,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985871080] [2020-02-10 19:52:23,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:23,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:23,534 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:23,695 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 19:52:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:23,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:23,698 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:52:23,698 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:52:23,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:52:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 19:52:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:52:23,720 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:52:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:23,720 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:52:23,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:52:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:23,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:23,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:23,721 INFO L427 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash -49106143, now seen corresponding path program 923 times [2020-02-10 19:52:23,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:23,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897782195] [2020-02-10 19:52:23,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:24,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897782195] [2020-02-10 19:52:24,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:24,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:24,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553051588] [2020-02-10 19:52:24,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:24,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:24,077 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:52:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:24,211 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 19:52:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:24,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:24,214 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:52:24,215 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:52:24,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:52:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 19:52:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:52:24,235 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:24,236 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:52:24,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:52:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:24,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:24,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:24,237 INFO L427 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2099690393, now seen corresponding path program 924 times [2020-02-10 19:52:24,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:24,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669254182] [2020-02-10 19:52:24,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:24,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669254182] [2020-02-10 19:52:24,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:24,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:24,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555443853] [2020-02-10 19:52:24,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:24,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:24,594 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:24,761 INFO L93 Difference]: Finished difference Result 1180 states and 4184 transitions. [2020-02-10 19:52:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:24,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:24,765 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:52:24,765 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:52:24,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:52:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 19:52:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:52:24,786 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:52:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:24,786 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:52:24,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:52:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:24,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:24,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:24,787 INFO L427 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1167322591, now seen corresponding path program 925 times [2020-02-10 19:52:24,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:24,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753309799] [2020-02-10 19:52:24,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:25,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753309799] [2020-02-10 19:52:25,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:25,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:25,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068443262] [2020-02-10 19:52:25,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:25,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:25,127 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:52:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:25,262 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-02-10 19:52:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:25,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:25,266 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:52:25,266 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:52:25,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:52:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 19:52:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 19:52:25,287 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 19:52:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:25,287 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 19:52:25,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 19:52:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:25,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:25,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:25,288 INFO L427 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:25,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash -176064769, now seen corresponding path program 926 times [2020-02-10 19:52:25,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:25,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582745579] [2020-02-10 19:52:25,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:25,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582745579] [2020-02-10 19:52:25,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:25,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:25,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299088858] [2020-02-10 19:52:25,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:25,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:25,627 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:52:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:25,803 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-02-10 19:52:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:25,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:25,807 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:52:25,807 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:25,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:52:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:52:25,828 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:52:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:25,828 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:52:25,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:52:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:25,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:25,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:25,829 INFO L427 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:25,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash 315812347, now seen corresponding path program 927 times [2020-02-10 19:52:25,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:25,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704741598] [2020-02-10 19:52:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:26,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704741598] [2020-02-10 19:52:26,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:26,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836721636] [2020-02-10 19:52:26,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:26,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:26,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:26,167 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:52:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:26,304 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-02-10 19:52:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:26,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:26,307 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:52:26,307 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:52:26,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:52:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 19:52:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:52:26,328 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:26,328 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:52:26,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:52:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:26,330 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:26,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:26,330 INFO L427 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1338579481, now seen corresponding path program 928 times [2020-02-10 19:52:26,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:26,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443746222] [2020-02-10 19:52:26,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:26,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443746222] [2020-02-10 19:52:26,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:26,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503460580] [2020-02-10 19:52:26,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:26,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:26,669 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:26,812 INFO L93 Difference]: Finished difference Result 1186 states and 4197 transitions. [2020-02-10 19:52:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:26,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:26,815 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:52:26,815 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:52:26,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:52:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 19:52:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:52:26,837 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:52:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:26,837 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:52:26,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:52:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:26,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:26,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:26,838 INFO L427 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1464945313, now seen corresponding path program 929 times [2020-02-10 19:52:26,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:26,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180816243] [2020-02-10 19:52:26,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:27,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 19:52:27,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180816243] [2020-02-10 19:52:27,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:27,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:27,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651145831] [2020-02-10 19:52:27,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:27,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:27,192 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:52:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:27,336 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-02-10 19:52:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:27,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:27,339 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:52:27,340 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:27,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 19:52:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:52:27,361 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:52:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,361 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:52:27,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:52:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:27,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:27,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:27,363 INFO L427 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2002800891, now seen corresponding path program 930 times [2020-02-10 19:52:27,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467585434] [2020-02-10 19:52:27,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:27,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467585434] [2020-02-10 19:52:27,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:27,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:27,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679735921] [2020-02-10 19:52:27,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:27,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:27,714 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:52:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:27,889 INFO L93 Difference]: Finished difference Result 1189 states and 4201 transitions. [2020-02-10 19:52:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:27,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:27,892 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:52:27,893 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:52:27,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:52:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 19:52:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:52:27,915 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:52:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,915 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:52:27,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:52:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:27,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:27,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] [2020-02-10 19:52:27,916 INFO L427 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash -426732647, now seen corresponding path program 931 times [2020-02-10 19:52:27,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345423498] [2020-02-10 19:52:27,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:28,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 19:52:28,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345423498] [2020-02-10 19:52:28,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:28,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:28,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135458712] [2020-02-10 19:52:28,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:28,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:28,258 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:52:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:28,400 INFO L93 Difference]: Finished difference Result 1190 states and 4207 transitions. [2020-02-10 19:52:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:28,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:28,403 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:52:28,404 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:28,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-02-10 19:52:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:52:28,426 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:28,426 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:52:28,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:52:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:28,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:28,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] [2020-02-10 19:52:28,427 INFO L427 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1184208311, now seen corresponding path program 932 times [2020-02-10 19:52:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:28,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599874926] [2020-02-10 19:52:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:28,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599874926] [2020-02-10 19:52:28,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:28,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:28,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122721611] [2020-02-10 19:52:28,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:28,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:28,774 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:28,955 INFO L93 Difference]: Finished difference Result 1194 states and 4212 transitions. [2020-02-10 19:52:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:28,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:28,958 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:52:28,958 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:52:28,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:52:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 19:52:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:52:28,979 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:52:28,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:28,980 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:52:28,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:52:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:28,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:28,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:28,981 INFO L427 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:28,981 INFO L82 PathProgramCache]: Analyzing trace with hash -933078913, now seen corresponding path program 933 times [2020-02-10 19:52:28,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:28,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741836637] [2020-02-10 19:52:28,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:29,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741836637] [2020-02-10 19:52:29,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:29,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:29,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609875035] [2020-02-10 19:52:29,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:29,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:29,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:29,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:29,337 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:52:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:29,476 INFO L93 Difference]: Finished difference Result 1184 states and 4192 transitions. [2020-02-10 19:52:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:29,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:29,479 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:52:29,479 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:52:29,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:52:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 19:52:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:52:29,500 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:52:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:29,500 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:52:29,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:52:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:29,501 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:29,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:29,501 INFO L427 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1215717623, now seen corresponding path program 934 times [2020-02-10 19:52:29,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:29,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359778537] [2020-02-10 19:52:29,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:29,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359778537] [2020-02-10 19:52:29,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:29,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:29,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319334419] [2020-02-10 19:52:29,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:29,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:29,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:29,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:29,850 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:52:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:30,009 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 19:52:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:30,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:30,013 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:52:30,013 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:52:30,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:52:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 19:52:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:52:30,034 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:52:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:30,034 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:52:30,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:52:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:30,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:30,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:30,035 INFO L427 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash -922575809, now seen corresponding path program 935 times [2020-02-10 19:52:30,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:30,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871732714] [2020-02-10 19:52:30,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:30,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871732714] [2020-02-10 19:52:30,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:30,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:30,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682628895] [2020-02-10 19:52:30,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:30,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:30,375 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:52:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:30,511 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-02-10 19:52:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:30,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:30,514 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:52:30,514 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:52:30,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:52:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:52:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:52:30,536 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:30,536 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:52:30,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:52:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:30,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:30,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:30,537 INFO L427 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash -384720231, now seen corresponding path program 936 times [2020-02-10 19:52:30,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:30,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235934974] [2020-02-10 19:52:30,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:30,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235934974] [2020-02-10 19:52:30,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:30,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:30,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847945990] [2020-02-10 19:52:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:30,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:30,875 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:52:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:31,065 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-02-10 19:52:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:31,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:31,068 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:52:31,068 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:52:31,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:52:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 771. [2020-02-10 19:52:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:52:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 19:52:31,089 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 19:52:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,089 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 19:52:31,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 19:52:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:31,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:31,090 INFO L427 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -241103101, now seen corresponding path program 937 times [2020-02-10 19:52:31,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201597049] [2020-02-10 19:52:31,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:31,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201597049] [2020-02-10 19:52:31,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:31,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:31,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72368748] [2020-02-10 19:52:31,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:31,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:31,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:31,439 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 19:52:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:31,579 INFO L93 Difference]: Finished difference Result 1206 states and 4252 transitions. [2020-02-10 19:52:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:31,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:31,582 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:52:31,582 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:52:31,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:52:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 779. [2020-02-10 19:52:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 19:52:31,603 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 19:52:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,603 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 19:52:31,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 19:52:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:31,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:31,605 INFO L427 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1369837857, now seen corresponding path program 938 times [2020-02-10 19:52:31,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050691233] [2020-02-10 19:52:31,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:31,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050691233] [2020-02-10 19:52:31,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:31,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:31,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129945644] [2020-02-10 19:52:31,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:31,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:31,959 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:52:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:32,113 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-02-10 19:52:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:32,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:32,117 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:52:32,117 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:52:32,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:52:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-02-10 19:52:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:52:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 19:52:32,138 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:32,138 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 19:52:32,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 19:52:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:32,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:32,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:32,139 INFO L427 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1841540955, now seen corresponding path program 939 times [2020-02-10 19:52:32,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:32,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782494273] [2020-02-10 19:52:32,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:32,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782494273] [2020-02-10 19:52:32,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756022545] [2020-02-10 19:52:32,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:32,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:32,500 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:32,631 INFO L93 Difference]: Finished difference Result 1213 states and 4266 transitions. [2020-02-10 19:52:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:32,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:32,634 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:52:32,634 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:52:32,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:52:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 19:52:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:52:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 19:52:32,656 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 19:52:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:32,656 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 19:52:32,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 19:52:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:32,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:32,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:32,657 INFO L427 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1380340961, now seen corresponding path program 940 times [2020-02-10 19:52:32,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:32,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656630268] [2020-02-10 19:52:32,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:33,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656630268] [2020-02-10 19:52:33,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:33,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100221] [2020-02-10 19:52:33,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:33,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:33,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:33,021 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:52:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:33,177 INFO L93 Difference]: Finished difference Result 1214 states and 4262 transitions. [2020-02-10 19:52:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:33,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:33,180 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:52:33,180 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:52:33,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:52:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-02-10 19:52:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:52:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 19:52:33,202 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:33,202 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 19:52:33,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 19:52:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:33,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:33,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:33,203 INFO L427 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1831037851, now seen corresponding path program 941 times [2020-02-10 19:52:33,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:33,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700571753] [2020-02-10 19:52:33,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,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 19:52:33,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700571753] [2020-02-10 19:52:33,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:33,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808282471] [2020-02-10 19:52:33,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:33,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:33,567 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:33,703 INFO L93 Difference]: Finished difference Result 1204 states and 4242 transitions. [2020-02-10 19:52:33,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:33,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:33,706 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:52:33,707 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:52:33,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:52:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 779. [2020-02-10 19:52:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:52:33,728 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:33,728 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:52:33,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:52:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:33,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:33,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:33,729 INFO L427 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -220096893, now seen corresponding path program 942 times [2020-02-10 19:52:33,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:33,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534794328] [2020-02-10 19:52:33,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:34,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534794328] [2020-02-10 19:52:34,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:34,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:34,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510160442] [2020-02-10 19:52:34,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:34,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:34,075 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,229 INFO L93 Difference]: Finished difference Result 1208 states and 4247 transitions. [2020-02-10 19:52:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:34,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,233 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:52:34,233 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:34,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-02-10 19:52:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:52:34,254 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:52:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:34,254 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:52:34,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:52:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:34,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:34,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:34,255 INFO L427 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1242031837, now seen corresponding path program 943 times [2020-02-10 19:52:34,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:34,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223199619] [2020-02-10 19:52:34,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:34,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223199619] [2020-02-10 19:52:34,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:34,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:34,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067150763] [2020-02-10 19:52:34,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:34,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:34,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:34,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:34,607 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:52:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,782 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-02-10 19:52:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:34,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,786 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:52:34,786 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:52:34,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:52:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 778. [2020-02-10 19:52:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 19:52:34,807 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:34,807 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 19:52:34,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 19:52:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:34,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:34,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:34,808 INFO L427 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1441994501, now seen corresponding path program 944 times [2020-02-10 19:52:34,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:34,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404722911] [2020-02-10 19:52:34,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:35,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 19:52:35,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404722911] [2020-02-10 19:52:35,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:35,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:35,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808600003] [2020-02-10 19:52:35,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:35,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:35,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:35,161 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:35,298 INFO L93 Difference]: Finished difference Result 1192 states and 4212 transitions. [2020-02-10 19:52:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:35,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:35,302 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:52:35,302 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:52:35,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:52:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 19:52:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:52:35,323 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:52:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:35,323 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:52:35,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:52:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:35,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:35,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:35,324 INFO L427 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -864752283, now seen corresponding path program 945 times [2020-02-10 19:52:35,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:35,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118353377] [2020-02-10 19:52:35,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:35,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 19:52:35,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118353377] [2020-02-10 19:52:35,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:35,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:35,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029977261] [2020-02-10 19:52:35,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:35,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:35,680 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:52:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:35,815 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 19:52:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:35,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:35,819 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:52:35,819 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:35,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 19:52:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:52:35,840 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:35,840 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:52:35,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:52:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:35,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:35,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:35,841 INFO L427 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1399982085, now seen corresponding path program 946 times [2020-02-10 19:52:35,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:35,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057226047] [2020-02-10 19:52:35,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:36,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057226047] [2020-02-10 19:52:36,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:36,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:36,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898498677] [2020-02-10 19:52:36,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:36,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:36,179 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:36,316 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-02-10 19:52:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:36,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:36,319 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:52:36,320 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:52:36,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:52:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 19:52:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:52:36,340 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:52:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:36,340 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:52:36,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:52:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:36,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:36,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] [2020-02-10 19:52:36,341 INFO L427 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -854249179, now seen corresponding path program 947 times [2020-02-10 19:52:36,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:36,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007708286] [2020-02-10 19:52:36,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:36,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007708286] [2020-02-10 19:52:36,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:36,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:36,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474342332] [2020-02-10 19:52:36,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:36,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:36,702 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:52:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:36,839 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-02-10 19:52:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:36,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:36,842 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:52:36,842 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:52:36,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:52:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 19:52:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:52:36,863 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:52:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:36,863 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:52:36,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:52:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:36,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:36,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:36,864 INFO L427 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:36,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:36,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1294547357, now seen corresponding path program 948 times [2020-02-10 19:52:36,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:36,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544017347] [2020-02-10 19:52:36,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:37,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 19:52:37,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544017347] [2020-02-10 19:52:37,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:37,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:37,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594156565] [2020-02-10 19:52:37,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:37,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:37,214 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:52:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:37,347 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 19:52:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:37,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:37,350 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:52:37,350 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:52:37,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:52:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 19:52:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:52:37,371 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:52:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:37,372 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:52:37,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:52:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:37,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:37,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] [2020-02-10 19:52:37,373 INFO L427 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:37,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1567628061, now seen corresponding path program 949 times [2020-02-10 19:52:37,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:37,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191018877] [2020-02-10 19:52:37,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:37,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 19:52:37,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191018877] [2020-02-10 19:52:37,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:37,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:37,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878830802] [2020-02-10 19:52:37,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:37,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:37,735 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:52:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:37,868 INFO L93 Difference]: Finished difference Result 1209 states and 4253 transitions. [2020-02-10 19:52:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:37,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:37,872 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:52:37,872 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:52:37,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:52:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 19:52:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:52:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 19:52:37,892 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 19:52:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:37,892 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 19:52:37,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 19:52:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:37,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:37,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:37,894 INFO L427 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 494542681, now seen corresponding path program 950 times [2020-02-10 19:52:37,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:37,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532114492] [2020-02-10 19:52:37,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:38,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532114492] [2020-02-10 19:52:38,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:38,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:38,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22701860] [2020-02-10 19:52:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:38,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:38,242 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:52:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:38,376 INFO L93 Difference]: Finished difference Result 1210 states and 4249 transitions. [2020-02-10 19:52:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:38,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:38,380 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:52:38,380 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:52:38,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:52:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-02-10 19:52:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:52:38,402 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:52:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:38,402 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:52:38,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:52:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:38,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:38,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:38,403 INFO L427 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1061281795, now seen corresponding path program 951 times [2020-02-10 19:52:38,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:38,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192250816] [2020-02-10 19:52:38,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:38,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192250816] [2020-02-10 19:52:38,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:38,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:38,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560116189] [2020-02-10 19:52:38,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:38,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:38,741 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:52:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:38,876 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 19:52:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:38,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:38,880 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:52:38,880 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 19:52:38,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 19:52:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 777. [2020-02-10 19:52:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:52:38,902 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:52:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:38,902 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:52:38,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:52:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:38,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:38,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:38,903 INFO L427 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash 526051993, now seen corresponding path program 952 times [2020-02-10 19:52:38,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:38,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749130481] [2020-02-10 19:52:38,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:39,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 19:52:39,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749130481] [2020-02-10 19:52:39,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:39,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:39,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869422864] [2020-02-10 19:52:39,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:39,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:39,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:39,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:39,261 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:52:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:39,392 INFO L93 Difference]: Finished difference Result 1196 states and 4219 transitions. [2020-02-10 19:52:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:39,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:39,395 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:52:39,395 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 19:52:39,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 19:52:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-02-10 19:52:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:52:39,416 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:52:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:39,417 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:52:39,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:52:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:39,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:39,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] [2020-02-10 19:52:39,418 INFO L427 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1082288003, now seen corresponding path program 953 times [2020-02-10 19:52:39,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:39,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9296092] [2020-02-10 19:52:39,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:39,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9296092] [2020-02-10 19:52:39,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:39,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:39,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495909927] [2020-02-10 19:52:39,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:39,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:39,762 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:52:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:39,896 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-02-10 19:52:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:39,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:39,900 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:52:39,900 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:39,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 19:52:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:52:39,921 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:39,921 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:52:39,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:52:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:39,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:39,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:39,922 INFO L427 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1620143581, now seen corresponding path program 954 times [2020-02-10 19:52:39,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:39,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805664212] [2020-02-10 19:52:39,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:40,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805664212] [2020-02-10 19:52:40,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:40,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:40,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499188504] [2020-02-10 19:52:40,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:40,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:40,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:40,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:40,269 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:52:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:40,409 INFO L93 Difference]: Finished difference Result 1197 states and 4219 transitions. [2020-02-10 19:52:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:40,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:40,412 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:52:40,412 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:52:40,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:52:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 19:52:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:52:40,433 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:52:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:40,433 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:52:40,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:52:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:40,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:40,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:40,434 INFO L427 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash -790802053, now seen corresponding path program 955 times [2020-02-10 19:52:40,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:40,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670988914] [2020-02-10 19:52:40,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:40,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670988914] [2020-02-10 19:52:40,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:40,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:40,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248996353] [2020-02-10 19:52:40,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:40,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:40,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:40,784 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:52:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:40,904 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-02-10 19:52:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:40,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:40,908 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:52:40,908 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:52:40,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:52:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 778. [2020-02-10 19:52:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 19:52:40,939 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 19:52:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:40,940 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 19:52:40,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 19:52:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:40,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:40,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:40,941 INFO L427 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash 820138905, now seen corresponding path program 956 times [2020-02-10 19:52:40,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:40,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841454836] [2020-02-10 19:52:40,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:41,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841454836] [2020-02-10 19:52:41,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:41,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:41,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283255775] [2020-02-10 19:52:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:41,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:41,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:41,287 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:52:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:41,418 INFO L93 Difference]: Finished difference Result 1198 states and 4220 transitions. [2020-02-10 19:52:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:41,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:41,421 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:52:41,422 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:52:41,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:52:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 775. [2020-02-10 19:52:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:52:41,443 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:52:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:41,443 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:52:41,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:52:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:41,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:41,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:41,444 INFO L427 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1297148319, now seen corresponding path program 957 times [2020-02-10 19:52:41,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:41,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705303279] [2020-02-10 19:52:41,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:41,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 19:52:41,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705303279] [2020-02-10 19:52:41,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:41,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:41,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391693952] [2020-02-10 19:52:41,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:41,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:41,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:41,790 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:52:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:41,913 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-02-10 19:52:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:41,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:41,916 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:52:41,916 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:52:41,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:52:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:52:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:52:41,937 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:41,937 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:52:41,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:52:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:41,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:41,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] [2020-02-10 19:52:41,938 INFO L427 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:41,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:41,939 INFO L82 PathProgramCache]: Analyzing trace with hash 851648217, now seen corresponding path program 958 times [2020-02-10 19:52:41,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:41,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765763232] [2020-02-10 19:52:41,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:42,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765763232] [2020-02-10 19:52:42,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:42,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:42,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298788958] [2020-02-10 19:52:42,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:42,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:42,286 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:52:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:42,420 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-02-10 19:52:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:42,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:42,424 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:52:42,424 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:52:42,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:52:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 19:52:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:52:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:52:42,445 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:52:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:42,445 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:52:42,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:52:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:42,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:42,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:42,446 INFO L427 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1286645215, now seen corresponding path program 959 times [2020-02-10 19:52:42,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:42,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387434044] [2020-02-10 19:52:42,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:42,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387434044] [2020-02-10 19:52:42,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:42,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:42,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496967740] [2020-02-10 19:52:42,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:42,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:42,803 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:52:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:42,922 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-02-10 19:52:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:42,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:42,926 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:52:42,926 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:52:42,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:52:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 19:52:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:52:42,947 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:52:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:42,947 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:52:42,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:52:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:42,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:42,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:42,949 INFO L427 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash -748789637, now seen corresponding path program 960 times [2020-02-10 19:52:42,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:42,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491383948] [2020-02-10 19:52:42,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:43,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491383948] [2020-02-10 19:52:43,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:43,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:43,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748302601] [2020-02-10 19:52:43,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:43,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:43,297 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:52:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:43,429 INFO L93 Difference]: Finished difference Result 1191 states and 4202 transitions. [2020-02-10 19:52:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:43,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:43,433 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:52:43,433 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:52:43,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:52:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 769. [2020-02-10 19:52:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 19:52:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3074 transitions. [2020-02-10 19:52:43,454 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3074 transitions. Word has length 25 [2020-02-10 19:52:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:43,454 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3074 transitions. [2020-02-10 19:52:43,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3074 transitions. [2020-02-10 19:52:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:43,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:43,455 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:43,455 INFO L427 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 377256515, now seen corresponding path program 961 times [2020-02-10 19:52:43,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:43,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092928829] [2020-02-10 19:52:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:43,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 19:52:43,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092928829] [2020-02-10 19:52:43,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:43,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:43,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110360701] [2020-02-10 19:52:43,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:43,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:43,809 INFO L87 Difference]: Start difference. First operand 769 states and 3074 transitions. Second operand 10 states. [2020-02-10 19:52:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:43,938 INFO L93 Difference]: Finished difference Result 1207 states and 4273 transitions. [2020-02-10 19:52:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:43,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:43,941 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:52:43,942 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:52:43,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:52:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 19:52:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:52:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3117 transitions. [2020-02-10 19:52:43,963 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3117 transitions. Word has length 25 [2020-02-10 19:52:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:43,963 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3117 transitions. [2020-02-10 19:52:43,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3117 transitions. [2020-02-10 19:52:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:43,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:43,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:43,964 INFO L427 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1347508129, now seen corresponding path program 962 times [2020-02-10 19:52:43,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:43,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907881578] [2020-02-10 19:52:43,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:44,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907881578] [2020-02-10 19:52:44,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:44,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:44,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995595077] [2020-02-10 19:52:44,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:44,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:44,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:44,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:44,332 INFO L87 Difference]: Start difference. First operand 781 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:52:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:44,469 INFO L93 Difference]: Finished difference Result 1209 states and 4273 transitions. [2020-02-10 19:52:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:44,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:44,472 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:52:44,472 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:52:44,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:52:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:52:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3107 transitions. [2020-02-10 19:52:44,494 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3107 transitions. Word has length 25 [2020-02-10 19:52:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:44,494 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3107 transitions. [2020-02-10 19:52:44,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3107 transitions. [2020-02-10 19:52:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:44,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:44,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:44,495 INFO L427 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:44,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1991676703, now seen corresponding path program 963 times [2020-02-10 19:52:44,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:44,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606185232] [2020-02-10 19:52:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:44,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606185232] [2020-02-10 19:52:44,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:44,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:44,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845165172] [2020-02-10 19:52:44,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:44,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:44,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:44,858 INFO L87 Difference]: Start difference. First operand 777 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:52:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:44,992 INFO L93 Difference]: Finished difference Result 1203 states and 4261 transitions. [2020-02-10 19:52:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:44,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:44,995 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:52:44,995 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:52:44,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:52:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 19:52:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 19:52:45,016 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 19:52:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:45,016 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 19:52:45,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 19:52:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:45,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:45,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:45,017 INFO L427 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1010921985, now seen corresponding path program 964 times [2020-02-10 19:52:45,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:45,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784571793] [2020-02-10 19:52:45,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:45,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 19:52:45,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784571793] [2020-02-10 19:52:45,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:45,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:45,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116627689] [2020-02-10 19:52:45,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:45,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:45,380 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:52:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:45,511 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-02-10 19:52:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:45,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:45,515 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:52:45,515 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 19:52:45,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 19:52:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-02-10 19:52:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3104 transitions. [2020-02-10 19:52:45,537 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3104 transitions. Word has length 25 [2020-02-10 19:52:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:45,537 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3104 transitions. [2020-02-10 19:52:45,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3104 transitions. [2020-02-10 19:52:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:45,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:45,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:45,538 INFO L427 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1686133315, now seen corresponding path program 965 times [2020-02-10 19:52:45,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:45,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656947309] [2020-02-10 19:52:45,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:45,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656947309] [2020-02-10 19:52:45,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:45,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:45,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750358031] [2020-02-10 19:52:45,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:45,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:45,908 INFO L87 Difference]: Start difference. First operand 777 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:52:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:46,033 INFO L93 Difference]: Finished difference Result 1207 states and 4266 transitions. [2020-02-10 19:52:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:46,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:46,036 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:52:46,036 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:52:46,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:52:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-02-10 19:52:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 19:52:46,057 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 19:52:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:46,057 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 19:52:46,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 19:52:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:46,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:46,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:46,059 INFO L427 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash -997893023, now seen corresponding path program 966 times [2020-02-10 19:52:46,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:46,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603434421] [2020-02-10 19:52:46,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:46,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603434421] [2020-02-10 19:52:46,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:46,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:46,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409115140] [2020-02-10 19:52:46,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:46,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:46,422 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:52:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:46,555 INFO L93 Difference]: Finished difference Result 1204 states and 4257 transitions. [2020-02-10 19:52:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:46,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:46,559 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:52:46,559 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:46,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-02-10 19:52:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:52:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3096 transitions. [2020-02-10 19:52:46,580 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3096 transitions. Word has length 25 [2020-02-10 19:52:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:46,580 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3096 transitions. [2020-02-10 19:52:46,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3096 transitions. [2020-02-10 19:52:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:46,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:46,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] [2020-02-10 19:52:46,581 INFO L427 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash -467714937, now seen corresponding path program 967 times [2020-02-10 19:52:46,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:46,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252247536] [2020-02-10 19:52:46,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:46,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252247536] [2020-02-10 19:52:46,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:46,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:46,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825443644] [2020-02-10 19:52:46,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:46,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:46,948 INFO L87 Difference]: Start difference. First operand 774 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:52:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:47,073 INFO L93 Difference]: Finished difference Result 1213 states and 4287 transitions. [2020-02-10 19:52:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:47,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:47,076 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:52:47,076 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:52:47,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:52:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 782. [2020-02-10 19:52:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:52:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-02-10 19:52:47,109 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-02-10 19:52:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:47,109 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-02-10 19:52:47,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-02-10 19:52:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:47,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:47,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:47,111 INFO L427 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 502536677, now seen corresponding path program 968 times [2020-02-10 19:52:47,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:47,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750841990] [2020-02-10 19:52:47,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:47,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750841990] [2020-02-10 19:52:47,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:47,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:47,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013800611] [2020-02-10 19:52:47,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:47,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:47,477 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-02-10 19:52:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:47,610 INFO L93 Difference]: Finished difference Result 1215 states and 4287 transitions. [2020-02-10 19:52:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:47,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:47,613 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:52:47,613 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:52:47,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:52:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 778. [2020-02-10 19:52:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3107 transitions. [2020-02-10 19:52:47,635 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3107 transitions. Word has length 25 [2020-02-10 19:52:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:47,635 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3107 transitions. [2020-02-10 19:52:47,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3107 transitions. [2020-02-10 19:52:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:47,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:47,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:47,637 INFO L427 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1015420001, now seen corresponding path program 969 times [2020-02-10 19:52:47,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:47,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253004142] [2020-02-10 19:52:47,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:48,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253004142] [2020-02-10 19:52:48,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:48,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:48,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161124005] [2020-02-10 19:52:48,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:48,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:48,008 INFO L87 Difference]: Start difference. First operand 778 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:52:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:48,140 INFO L93 Difference]: Finished difference Result 1212 states and 4281 transitions. [2020-02-10 19:52:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:48,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:48,143 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:52:48,143 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 19:52:48,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 19:52:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 782. [2020-02-10 19:52:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:52:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3114 transitions. [2020-02-10 19:52:48,165 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3114 transitions. Word has length 25 [2020-02-10 19:52:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:48,165 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3114 transitions. [2020-02-10 19:52:48,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3114 transitions. [2020-02-10 19:52:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:48,166 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:48,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:48,166 INFO L427 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:48,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2017180927, now seen corresponding path program 970 times [2020-02-10 19:52:48,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:48,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020840244] [2020-02-10 19:52:48,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:48,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020840244] [2020-02-10 19:52:48,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:48,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:48,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344882539] [2020-02-10 19:52:48,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:48,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:48,537 INFO L87 Difference]: Start difference. First operand 782 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:52:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:48,676 INFO L93 Difference]: Finished difference Result 1213 states and 4279 transitions. [2020-02-10 19:52:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:48,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:48,679 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:52:48,679 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:52:48,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:52:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 778. [2020-02-10 19:52:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:52:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3103 transitions. [2020-02-10 19:52:48,700 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3103 transitions. Word has length 25 [2020-02-10 19:52:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:48,700 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3103 transitions. [2020-02-10 19:52:48,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3103 transitions. [2020-02-10 19:52:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:48,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:48,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:48,702 INFO L427 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1492354311, now seen corresponding path program 971 times [2020-02-10 19:52:48,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:48,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478800960] [2020-02-10 19:52:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:49,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478800960] [2020-02-10 19:52:49,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:49,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:49,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459739735] [2020-02-10 19:52:49,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:49,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:49,069 INFO L87 Difference]: Start difference. First operand 778 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:52:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,210 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-02-10 19:52:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:49,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,213 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 19:52:49,213 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:52:49,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:52:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 783. [2020-02-10 19:52:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:52:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 19:52:49,234 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 19:52:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,234 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 19:52:49,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 19:52:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:49,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:49,236 INFO L427 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2030209889, now seen corresponding path program 972 times [2020-02-10 19:52:49,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719181614] [2020-02-10 19:52:49,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:49,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 19:52:49,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719181614] [2020-02-10 19:52:49,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:49,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:49,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278232151] [2020-02-10 19:52:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:49,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:49,604 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:52:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,734 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 19:52:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:49,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,737 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:52:49,737 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:52:49,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:52:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 774. [2020-02-10 19:52:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:52:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3093 transitions. [2020-02-10 19:52:49,759 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3093 transitions. Word has length 25 [2020-02-10 19:52:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,759 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3093 transitions. [2020-02-10 19:52:49,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3093 transitions. [2020-02-10 19:52:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:49,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:49,760 INFO L427 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1035833415, now seen corresponding path program 973 times [2020-02-10 19:52:49,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319806520] [2020-02-10 19:52:49,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:50,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 19:52:50,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319806520] [2020-02-10 19:52:50,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:50,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:50,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433452632] [2020-02-10 19:52:50,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:50,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:50,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:50,142 INFO L87 Difference]: Start difference. First operand 774 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:52:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:50,287 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-02-10 19:52:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:50,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:50,291 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:52:50,291 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:52:50,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:52:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-02-10 19:52:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 19:52:50,313 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 19:52:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:50,313 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 19:52:50,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 19:52:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:50,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:50,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:50,314 INFO L427 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2016588133, now seen corresponding path program 974 times [2020-02-10 19:52:50,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:50,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406693143] [2020-02-10 19:52:50,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:50,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406693143] [2020-02-10 19:52:50,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:50,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:50,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636864959] [2020-02-10 19:52:50,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:50,680 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:52:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:50,813 INFO L93 Difference]: Finished difference Result 1201 states and 4251 transitions. [2020-02-10 19:52:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:50,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:50,817 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:52:50,817 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:52:50,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:52:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 19:52:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 19:52:50,839 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 19:52:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:50,840 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 19:52:50,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 19:52:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:50,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:50,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] [2020-02-10 19:52:50,841 INFO L427 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:50,841 INFO L82 PathProgramCache]: Analyzing trace with hash 592934275, now seen corresponding path program 975 times [2020-02-10 19:52:50,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:50,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096904199] [2020-02-10 19:52:50,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:51,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096904199] [2020-02-10 19:52:51,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:51,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:51,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385171890] [2020-02-10 19:52:51,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:51,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:51,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:51,209 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:52:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:51,359 INFO L93 Difference]: Finished difference Result 1205 states and 4260 transitions. [2020-02-10 19:52:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:51,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:51,363 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:52:51,363 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:52:51,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:52:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-02-10 19:52:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:52:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 19:52:51,385 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 19:52:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:51,385 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 19:52:51,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 19:52:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:51,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:51,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:51,386 INFO L427 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1594695201, now seen corresponding path program 976 times [2020-02-10 19:52:51,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:51,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925860200] [2020-02-10 19:52:51,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:51,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925860200] [2020-02-10 19:52:51,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:51,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:51,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004929119] [2020-02-10 19:52:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:51,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:51,761 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:52:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:51,912 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-02-10 19:52:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:51,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:51,916 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:52:51,916 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:52:51,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:52:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 19:52:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:52:51,937 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:51,937 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:52:51,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:52:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:51,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:51,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] [2020-02-10 19:52:51,939 INFO L427 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1288561529, now seen corresponding path program 977 times [2020-02-10 19:52:51,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:51,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568583099] [2020-02-10 19:52:51,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:52,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 19:52:52,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568583099] [2020-02-10 19:52:52,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:52,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:52,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576575817] [2020-02-10 19:52:52,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:52,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:52,299 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:52,446 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-02-10 19:52:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:52,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:52,450 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:52:52,450 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:52:52,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:52:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 19:52:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 19:52:52,471 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 19:52:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:52,471 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 19:52:52,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 19:52:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:52,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:52,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] [2020-02-10 19:52:52,472 INFO L427 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:52,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1933320387, now seen corresponding path program 978 times [2020-02-10 19:52:52,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:52,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770111608] [2020-02-10 19:52:52,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:52,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 19:52:52,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770111608] [2020-02-10 19:52:52,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:52,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:52,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700085443] [2020-02-10 19:52:52,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:52,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:52,847 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:52:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:52,992 INFO L93 Difference]: Finished difference Result 1204 states and 4251 transitions. [2020-02-10 19:52:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:52,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:52,995 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:52:52,996 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:52:52,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:52:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 774. [2020-02-10 19:52:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:52:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-02-10 19:52:53,017 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:53,017 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-02-10 19:52:53,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-02-10 19:52:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:53,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:53,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:53,019 INFO L427 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1989258399, now seen corresponding path program 979 times [2020-02-10 19:52:53,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:53,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122231819] [2020-02-10 19:52:53,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:53,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122231819] [2020-02-10 19:52:53,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:53,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:53,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520515968] [2020-02-10 19:52:53,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:53,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:53,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:53,376 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:52:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:53,506 INFO L93 Difference]: Finished difference Result 1209 states and 4268 transitions. [2020-02-10 19:52:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:53,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:53,509 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:52:53,510 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:52:53,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:52:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 780. [2020-02-10 19:52:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-02-10 19:52:53,531 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-02-10 19:52:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:53,531 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-02-10 19:52:53,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-02-10 19:52:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:53,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:53,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] [2020-02-10 19:52:53,532 INFO L427 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -378317441, now seen corresponding path program 980 times [2020-02-10 19:52:53,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:53,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56950834] [2020-02-10 19:52:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:53,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56950834] [2020-02-10 19:52:53,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:53,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:53,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032820709] [2020-02-10 19:52:53,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:53,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:53,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:53,905 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:52:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,063 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-02-10 19:52:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:54,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,066 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:52:54,066 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:52:54,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:52:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 19:52:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:52:54,087 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:52:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,087 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:52:54,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:52:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:54,088 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,088 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:54,088 INFO L427 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:54,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,089 INFO L82 PathProgramCache]: Analyzing trace with hash -895166811, now seen corresponding path program 981 times [2020-02-10 19:52:54,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983208919] [2020-02-10 19:52:54,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:54,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983208919] [2020-02-10 19:52:54,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:54,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:54,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575147240] [2020-02-10 19:52:54,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:54,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:54,453 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:52:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,578 INFO L93 Difference]: Finished difference Result 1213 states and 4275 transitions. [2020-02-10 19:52:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:54,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,580 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:52:54,580 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:52:54,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:52:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 19:52:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:52:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 19:52:54,602 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 19:52:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,602 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 19:52:54,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 19:52:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:54,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,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] [2020-02-10 19:52:54,604 INFO L427 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -357311233, now seen corresponding path program 982 times [2020-02-10 19:52:54,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405940303] [2020-02-10 19:52:54,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:54,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405940303] [2020-02-10 19:52:54,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:54,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:54,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085687415] [2020-02-10 19:52:54,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:54,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:54,967 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:52:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:55,116 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 19:52:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:55,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:55,119 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:52:55,119 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:52:55,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:52:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 19:52:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:52:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 19:52:55,142 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 19:52:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:55,142 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 19:52:55,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 19:52:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:55,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:55,143 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:55,143 INFO L427 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -884663707, now seen corresponding path program 983 times [2020-02-10 19:52:55,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:55,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992170956] [2020-02-10 19:52:55,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:55,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992170956] [2020-02-10 19:52:55,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:55,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:55,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557484115] [2020-02-10 19:52:55,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:55,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:55,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:55,523 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:52:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:55,653 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-02-10 19:52:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:55,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:55,657 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:52:55,657 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:52:55,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:52:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-02-10 19:52:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 19:52:55,679 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 19:52:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:55,679 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 19:52:55,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 19:52:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:55,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:55,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:55,680 INFO L427 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1957749087, now seen corresponding path program 984 times [2020-02-10 19:52:55,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:55,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811251547] [2020-02-10 19:52:55,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:56,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811251547] [2020-02-10 19:52:56,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:56,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:56,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785775247] [2020-02-10 19:52:56,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:56,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:56,043 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:52:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:56,210 INFO L93 Difference]: Finished difference Result 1207 states and 4255 transitions. [2020-02-10 19:52:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:56,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:56,213 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:52:56,213 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:52:56,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:52:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-02-10 19:52:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:52:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-02-10 19:52:56,234 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-02-10 19:52:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:56,235 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-02-10 19:52:56,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-02-10 19:52:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:56,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:56,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:56,236 INFO L427 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash -47054721, now seen corresponding path program 985 times [2020-02-10 19:52:56,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:56,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78708568] [2020-02-10 19:52:56,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:56,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78708568] [2020-02-10 19:52:56,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:56,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:56,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164823922] [2020-02-10 19:52:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:56,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:56,587 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:52:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:56,719 INFO L93 Difference]: Finished difference Result 1193 states and 4226 transitions. [2020-02-10 19:52:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:56,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:56,722 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:52:56,723 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:52:56,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:52:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 780. [2020-02-10 19:52:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:52:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3110 transitions. [2020-02-10 19:52:56,744 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3110 transitions. Word has length 25 [2020-02-10 19:52:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:56,744 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3110 transitions. [2020-02-10 19:52:56,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3110 transitions. [2020-02-10 19:52:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:56,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:56,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:56,746 INFO L427 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash 923196893, now seen corresponding path program 986 times [2020-02-10 19:52:56,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:56,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623260257] [2020-02-10 19:52:56,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:57,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623260257] [2020-02-10 19:52:57,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:57,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:57,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581317764] [2020-02-10 19:52:57,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:57,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:57,103 INFO L87 Difference]: Start difference. First operand 780 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:52:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:57,247 INFO L93 Difference]: Finished difference Result 1195 states and 4226 transitions. [2020-02-10 19:52:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:57,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:57,250 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:52:57,250 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:52:57,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:52:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 19:52:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:52:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-02-10 19:52:57,272 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-02-10 19:52:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:57,272 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-02-10 19:52:57,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-02-10 19:52:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:57,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:57,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:57,273 INFO L427 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1878979357, now seen corresponding path program 987 times [2020-02-10 19:52:57,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:57,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457805555] [2020-02-10 19:52:57,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:57,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457805555] [2020-02-10 19:52:57,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:57,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:57,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823373260] [2020-02-10 19:52:57,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:57,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:57,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:57,637 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:52:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:57,788 INFO L93 Difference]: Finished difference Result 1189 states and 4214 transitions. [2020-02-10 19:52:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:57,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:57,791 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:52:57,791 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:52:57,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:52:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 19:52:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 19:52:57,812 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 19:52:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:57,812 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 19:52:57,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 19:52:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:57,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:57,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:57,814 INFO L427 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1435233221, now seen corresponding path program 988 times [2020-02-10 19:52:57,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:57,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636844892] [2020-02-10 19:52:57,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:58,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636844892] [2020-02-10 19:52:58,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:58,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:58,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683640007] [2020-02-10 19:52:58,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:58,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:58,190 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:52:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:58,358 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-02-10 19:52:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:58,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:58,361 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:52:58,361 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:52:58,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:52:58,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-02-10 19:52:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:52:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3097 transitions. [2020-02-10 19:52:58,381 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3097 transitions. Word has length 25 [2020-02-10 19:52:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,382 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3097 transitions. [2020-02-10 19:52:58,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3097 transitions. [2020-02-10 19:52:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:58,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:58,383 INFO L427 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1261822079, now seen corresponding path program 989 times [2020-02-10 19:52:58,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066613839] [2020-02-10 19:52:58,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:58,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066613839] [2020-02-10 19:52:58,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:58,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:58,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817051701] [2020-02-10 19:52:58,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:58,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:58,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:58,741 INFO L87 Difference]: Start difference. First operand 776 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:52:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:58,903 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-02-10 19:52:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:58,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:58,907 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:52:58,907 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:52:58,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:52:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 779. [2020-02-10 19:52:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:52:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:52:58,928 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:52:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,928 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:52:58,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:52:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:58,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:58,930 INFO L427 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1422204259, now seen corresponding path program 990 times [2020-02-10 19:52:58,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841065533] [2020-02-10 19:52:58,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:59,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 19:52:59,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841065533] [2020-02-10 19:52:59,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:59,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:59,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753555302] [2020-02-10 19:52:59,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:59,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:59,295 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:52:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:59,479 INFO L93 Difference]: Finished difference Result 1190 states and 4210 transitions. [2020-02-10 19:52:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:52:59,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:52:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:59,482 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:52:59,482 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:52:59,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:52:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 19:52:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:52:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 19:52:59,503 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 19:52:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:59,504 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 19:52:59,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:52:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 19:52:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:52:59,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:59,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] [2020-02-10 19:52:59,505 INFO L427 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1736997625, now seen corresponding path program 991 times [2020-02-10 19:52:59,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:59,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952148950] [2020-02-10 19:52:59,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:59,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 19:52:59,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952148950] [2020-02-10 19:52:59,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:59,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:52:59,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151028710] [2020-02-10 19:52:59,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:52:59,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:59,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:52:59,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:52:59,863 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:00,003 INFO L93 Difference]: Finished difference Result 1189 states and 4212 transitions. [2020-02-10 19:53:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:00,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:00,006 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:53:00,006 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:53:00,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:53:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 19:53:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 19:53:00,028 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 19:53:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:00,028 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 19:53:00,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 19:53:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:00,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:00,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:00,029 INFO L427 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash -766746011, now seen corresponding path program 992 times [2020-02-10 19:53:00,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:00,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501254737] [2020-02-10 19:53:00,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:00,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501254737] [2020-02-10 19:53:00,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:00,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768166212] [2020-02-10 19:53:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:00,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:00,376 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:53:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:00,517 INFO L93 Difference]: Finished difference Result 1191 states and 4212 transitions. [2020-02-10 19:53:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:00,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:00,520 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:53:00,520 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:53:00,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:53:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-02-10 19:53:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 19:53:00,540 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 19:53:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:00,541 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 19:53:00,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 19:53:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:00,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:00,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:00,542 INFO L427 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash -696761827, now seen corresponding path program 993 times [2020-02-10 19:53:00,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:00,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114084013] [2020-02-10 19:53:00,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114084013] [2020-02-10 19:53:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:00,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628216825] [2020-02-10 19:53:00,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:00,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:00,895 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:53:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:01,049 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-02-10 19:53:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:01,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:01,053 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:53:01,053 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:53:01,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:53:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:53:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:53:01,086 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:01,086 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:53:01,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:53:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:01,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:01,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:01,088 INFO L427 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash 326005307, now seen corresponding path program 994 times [2020-02-10 19:53:01,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:01,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301409678] [2020-02-10 19:53:01,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:01,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301409678] [2020-02-10 19:53:01,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:01,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:01,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367622593] [2020-02-10 19:53:01,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:01,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:01,438 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:01,587 INFO L93 Difference]: Finished difference Result 1181 states and 4190 transitions. [2020-02-10 19:53:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:01,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:01,590 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:01,590 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:53:01,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:53:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 19:53:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:53:01,612 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:53:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:01,612 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:53:01,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:53:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:01,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:01,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:01,613 INFO L427 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 874264071, now seen corresponding path program 995 times [2020-02-10 19:53:01,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:01,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126907423] [2020-02-10 19:53:01,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:01,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 19:53:01,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126907423] [2020-02-10 19:53:01,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:01,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:01,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095789172] [2020-02-10 19:53:01,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:01,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:01,960 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:53:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:02,098 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 19:53:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:02,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:02,101 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:02,101 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:53:02,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:53:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 19:53:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:53:02,123 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:53:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:02,123 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:53:02,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:53:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:02,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:02,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] [2020-02-10 19:53:02,125 INFO L427 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash 339034269, now seen corresponding path program 996 times [2020-02-10 19:53:02,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:02,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113632891] [2020-02-10 19:53:02,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:02,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113632891] [2020-02-10 19:53:02,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:02,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:02,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571514236] [2020-02-10 19:53:02,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:02,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:02,472 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:53:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:02,604 INFO L93 Difference]: Finished difference Result 1183 states and 4192 transitions. [2020-02-10 19:53:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:02,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:02,608 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:53:02,608 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:53:02,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:53:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-02-10 19:53:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 19:53:02,629 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 19:53:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:02,629 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 19:53:02,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 19:53:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:02,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:02,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:02,646 INFO L427 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash -233449273, now seen corresponding path program 997 times [2020-02-10 19:53:02,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:02,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247984139] [2020-02-10 19:53:02,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53: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 19:53:03,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247984139] [2020-02-10 19:53:03,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:03,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:03,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852631952] [2020-02-10 19:53:03,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:03,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:03,010 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:53:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:03,171 INFO L93 Difference]: Finished difference Result 1181 states and 4192 transitions. [2020-02-10 19:53:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:03,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:03,175 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:03,175 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:53:03,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:53:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-02-10 19:53:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:53:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 19:53:03,196 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 19:53:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:03,196 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 19:53:03,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 19:53:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:03,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:03,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:03,198 INFO L427 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash 747305445, now seen corresponding path program 998 times [2020-02-10 19:53:03,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:03,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153086979] [2020-02-10 19:53:03,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:03,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153086979] [2020-02-10 19:53:03,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:03,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:03,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652515430] [2020-02-10 19:53:03,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:03,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:03,568 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:53:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:03,698 INFO L93 Difference]: Finished difference Result 1180 states and 4187 transitions. [2020-02-10 19:53:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:03,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:03,702 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:53:03,702 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:53:03,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:53:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-02-10 19:53:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:53:03,723 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:53:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:03,723 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:53:03,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:53:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:03,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:03,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] [2020-02-10 19:53:03,725 INFO L427 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1119247553, now seen corresponding path program 999 times [2020-02-10 19:53:03,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:03,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621403830] [2020-02-10 19:53:03,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621403830] [2020-02-10 19:53:04,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:04,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:04,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74521689] [2020-02-10 19:53:04,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:04,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:04,092 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:53:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:04,237 INFO L93 Difference]: Finished difference Result 1179 states and 4185 transitions. [2020-02-10 19:53:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:04,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:04,240 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:53:04,240 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:53:04,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:53:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 19:53:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:53:04,261 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:53:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:04,261 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:53:04,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:53:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:04,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:04,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:04,263 INFO L427 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash -96480419, now seen corresponding path program 1000 times [2020-02-10 19:53:04,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:04,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344003191] [2020-02-10 19:53:04,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:04,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344003191] [2020-02-10 19:53:04,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:04,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:04,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057563722] [2020-02-10 19:53:04,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:04,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:04,646 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:53:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:04,780 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-02-10 19:53:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:04,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:04,783 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 19:53:04,783 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:53:04,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:53:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 19:53:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:53:04,804 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:53:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:04,804 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:53:04,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:53:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:04,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:04,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] [2020-02-10 19:53:04,806 INFO L427 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1906651769, now seen corresponding path program 1001 times [2020-02-10 19:53:04,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:04,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790078652] [2020-02-10 19:53:04,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:05,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790078652] [2020-02-10 19:53:05,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:05,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:05,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973824929] [2020-02-10 19:53:05,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:05,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:05,176 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:53:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:05,315 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-02-10 19:53:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:05,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:05,318 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 19:53:05,319 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:53:05,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:05,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:53:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 19:53:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:53:05,340 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:05,340 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:53:05,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:53:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:05,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:05,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:05,342 INFO L427 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash 242144767, now seen corresponding path program 1002 times [2020-02-10 19:53:05,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:05,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155208154] [2020-02-10 19:53:05,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:05,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 19:53:05,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155208154] [2020-02-10 19:53:05,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:05,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:05,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704026651] [2020-02-10 19:53:05,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:05,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:05,705 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:05,867 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 19:53:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:05,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:05,871 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 19:53:05,871 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 19:53:05,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 19:53:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-02-10 19:53:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:53:05,892 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:53:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:05,892 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:53:05,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:53:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:05,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:05,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:05,894 INFO L427 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 593527069, now seen corresponding path program 1003 times [2020-02-10 19:53:05,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:05,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219993884] [2020-02-10 19:53:05,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:06,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 19:53:06,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219993884] [2020-02-10 19:53:06,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:06,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:06,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134958023] [2020-02-10 19:53:06,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:06,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:06,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:06,273 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:53:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:06,424 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 19:53:06,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:06,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:06,427 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:06,427 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:53:06,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:53:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 19:53:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:53:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 19:53:06,448 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:06,448 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 19:53:06,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 19:53:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:06,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:06,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:06,449 INFO L427 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2090499269, now seen corresponding path program 1004 times [2020-02-10 19:53:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:06,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997714238] [2020-02-10 19:53:06,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:06,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997714238] [2020-02-10 19:53:06,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:06,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:06,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951131127] [2020-02-10 19:53:06,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:06,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:06,811 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:06,953 INFO L93 Difference]: Finished difference Result 1184 states and 4193 transitions. [2020-02-10 19:53:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:06,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:06,957 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:53:06,957 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:06,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 19:53:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:53:06,978 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:53:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:06,978 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:53:06,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:53:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:06,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:06,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:06,980 INFO L427 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1513257051, now seen corresponding path program 1005 times [2020-02-10 19:53:06,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:06,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462113711] [2020-02-10 19:53:06,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:07,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462113711] [2020-02-10 19:53:07,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:07,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193151467] [2020-02-10 19:53:07,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:07,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:07,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:07,336 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:53:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:07,477 INFO L93 Difference]: Finished difference Result 1185 states and 4195 transitions. [2020-02-10 19:53:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:07,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:07,480 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 19:53:07,481 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:53:07,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:53:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:53:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:53:07,502 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:07,502 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:53:07,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:53:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:07,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:07,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:07,503 INFO L427 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2048486853, now seen corresponding path program 1006 times [2020-02-10 19:53:07,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:07,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456239830] [2020-02-10 19:53:07,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456239830] [2020-02-10 19:53:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:07,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127261646] [2020-02-10 19:53:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:07,871 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,027 INFO L93 Difference]: Finished difference Result 1181 states and 4185 transitions. [2020-02-10 19:53:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:08,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,030 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:08,030 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:53:08,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:53:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 19:53:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:53:08,052 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:53:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,052 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:53:08,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:53:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:08,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:08,053 INFO L427 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1502753947, now seen corresponding path program 1007 times [2020-02-10 19:53:08,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173368005] [2020-02-10 19:53:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:08,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173368005] [2020-02-10 19:53:08,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:08,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:08,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438926922] [2020-02-10 19:53:08,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:08,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:08,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:08,429 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:53:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,574 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 19:53:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:08,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,577 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:53:08,577 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:53:08,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:53:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 19:53:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:53:08,598 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,598 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:53:08,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:53:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:08,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,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] [2020-02-10 19:53:08,599 INFO L427 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash 646042589, now seen corresponding path program 1008 times [2020-02-10 19:53:08,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362643545] [2020-02-10 19:53:08,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:08,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362643545] [2020-02-10 19:53:08,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:08,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:08,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319222422] [2020-02-10 19:53:08,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:08,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:08,966 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:09,128 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-02-10 19:53:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:09,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:09,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:09,132 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 19:53:09,132 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 19:53:09,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 19:53:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-02-10 19:53:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:53:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 19:53:09,153 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 19:53:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:09,153 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 19:53:09,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 19:53:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:09,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:09,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:09,154 INFO L427 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:09,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1316337409, now seen corresponding path program 1009 times [2020-02-10 19:53:09,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:09,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178606456] [2020-02-10 19:53:09,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:09,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178606456] [2020-02-10 19:53:09,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:09,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:09,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999084123] [2020-02-10 19:53:09,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:09,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:09,525 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:53:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:09,658 INFO L93 Difference]: Finished difference Result 1205 states and 4258 transitions. [2020-02-10 19:53:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:09,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:09,662 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:53:09,662 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:53:09,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:53:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-02-10 19:53:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:53:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-02-10 19:53:09,683 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-02-10 19:53:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:09,683 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-02-10 19:53:09,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-02-10 19:53:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:09,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:09,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] [2020-02-10 19:53:09,684 INFO L427 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -346085795, now seen corresponding path program 1010 times [2020-02-10 19:53:09,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:09,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701392514] [2020-02-10 19:53:09,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:10,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701392514] [2020-02-10 19:53:10,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:10,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:10,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133296658] [2020-02-10 19:53:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:10,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:10,044 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:53:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:10,186 INFO L93 Difference]: Finished difference Result 1207 states and 4258 transitions. [2020-02-10 19:53:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:10,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:10,189 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:53:10,189 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:53:10,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:53:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 19:53:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 19:53:10,210 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 19:53:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:10,211 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 19:53:10,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 19:53:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:10,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:10,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:10,212 INFO L427 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 166797529, now seen corresponding path program 1011 times [2020-02-10 19:53:10,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:10,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752873159] [2020-02-10 19:53:10,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:10,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752873159] [2020-02-10 19:53:10,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:10,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:10,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596067973] [2020-02-10 19:53:10,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:10,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:10,576 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:53:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:10,706 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 19:53:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:10,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:10,709 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:53:10,709 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:53:10,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:53:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 781. [2020-02-10 19:53:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:53:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 19:53:10,730 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 19:53:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:10,730 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 19:53:10,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 19:53:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:10,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:10,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] [2020-02-10 19:53:10,731 INFO L427 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1168558455, now seen corresponding path program 1012 times [2020-02-10 19:53:10,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:10,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81449667] [2020-02-10 19:53:10,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:11,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 19:53:11,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81449667] [2020-02-10 19:53:11,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:11,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:11,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550317472] [2020-02-10 19:53:11,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:11,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:11,095 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:53:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,251 INFO L93 Difference]: Finished difference Result 1205 states and 4250 transitions. [2020-02-10 19:53:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:11,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,255 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:53:11,255 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 19:53:11,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 19:53:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-02-10 19:53:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 19:53:11,276 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 19:53:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:11,276 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 19:53:11,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 19:53:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:11,277 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:11,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:11,278 INFO L427 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash 643731839, now seen corresponding path program 1013 times [2020-02-10 19:53:11,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:11,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078113477] [2020-02-10 19:53:11,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:11,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078113477] [2020-02-10 19:53:11,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:11,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:11,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634583359] [2020-02-10 19:53:11,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:11,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:11,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:11,661 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:53:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,805 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-02-10 19:53:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:11,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,808 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:53:11,808 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:53:11,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:53:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 782. [2020-02-10 19:53:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:53:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3106 transitions. [2020-02-10 19:53:11,830 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3106 transitions. Word has length 25 [2020-02-10 19:53:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:11,830 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3106 transitions. [2020-02-10 19:53:11,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3106 transitions. [2020-02-10 19:53:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:11,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:11,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:11,831 INFO L427 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1181587417, now seen corresponding path program 1014 times [2020-02-10 19:53:11,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:11,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13022902] [2020-02-10 19:53:11,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:12,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 19:53:12,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13022902] [2020-02-10 19:53:12,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:12,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:12,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835334919] [2020-02-10 19:53:12,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:12,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:12,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:12,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:12,197 INFO L87 Difference]: Start difference. First operand 782 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:53:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:12,331 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-02-10 19:53:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:12,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:12,335 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:53:12,335 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 19:53:12,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 19:53:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 773. [2020-02-10 19:53:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 19:53:12,356 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 19:53:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:12,357 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 19:53:12,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 19:53:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:12,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:12,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] [2020-02-10 19:53:12,358 INFO L427 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2133658435, now seen corresponding path program 1015 times [2020-02-10 19:53:12,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:12,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916262381] [2020-02-10 19:53:12,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:12,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 19:53:12,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916262381] [2020-02-10 19:53:12,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:12,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328515076] [2020-02-10 19:53:12,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:12,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:12,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:12,711 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:53:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:12,870 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-02-10 19:53:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:12,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:12,873 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:53:12,873 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:53:12,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:53:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 19:53:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:53:12,895 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:53:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:12,895 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:53:12,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:53:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:12,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:12,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:12,896 INFO L427 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:12,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1191057247, now seen corresponding path program 1016 times [2020-02-10 19:53:12,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:12,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609664469] [2020-02-10 19:53:12,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:13,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609664469] [2020-02-10 19:53:13,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:13,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:13,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651715596] [2020-02-10 19:53:13,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:13,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:13,263 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:53:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:13,414 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-02-10 19:53:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:13,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:13,417 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:53:13,417 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:53:13,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:53:13,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:53:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:53:13,437 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:53:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:13,437 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:53:13,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:53:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:13,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:13,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:13,439 INFO L427 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1121073063, now seen corresponding path program 1017 times [2020-02-10 19:53:13,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:13,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383277045] [2020-02-10 19:53:13,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:13,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383277045] [2020-02-10 19:53:13,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:13,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:13,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048710375] [2020-02-10 19:53:13,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:13,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:13,796 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:53:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:13,931 INFO L93 Difference]: Finished difference Result 1189 states and 4211 transitions. [2020-02-10 19:53:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:13,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:13,935 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:53:13,935 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:53:13,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:53:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:53:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:53:13,957 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:53:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:13,957 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:53:13,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:53:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:13,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:13,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:13,958 INFO L427 AbstractCegarLoop]: === Iteration 1025 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -98305929, now seen corresponding path program 1018 times [2020-02-10 19:53:13,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:13,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836428775] [2020-02-10 19:53:13,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:14,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836428775] [2020-02-10 19:53:14,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:14,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:14,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974465940] [2020-02-10 19:53:14,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:14,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:14,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:14,310 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:53:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:14,475 INFO L93 Difference]: Finished difference Result 1187 states and 4205 transitions. [2020-02-10 19:53:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:14,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:14,478 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:14,478 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:53:14,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:53:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 19:53:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:53:14,500 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:53:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:14,500 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:53:14,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:53:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:14,501 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:14,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:14,501 INFO L427 AbstractCegarLoop]: === Iteration 1026 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash 449952835, now seen corresponding path program 1019 times [2020-02-10 19:53:14,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:14,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726477257] [2020-02-10 19:53:14,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:14,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 19:53:14,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726477257] [2020-02-10 19:53:14,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:14,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:14,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179945054] [2020-02-10 19:53:14,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:14,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:14,847 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:53:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:14,986 INFO L93 Difference]: Finished difference Result 1193 states and 4217 transitions. [2020-02-10 19:53:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:14,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:14,989 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:53:14,990 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:53:14,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:53:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 19:53:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:53:15,011 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:15,011 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:53:15,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:53:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:15,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:15,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:15,029 INFO L427 AbstractCegarLoop]: === Iteration 1027 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:15,030 INFO L82 PathProgramCache]: Analyzing trace with hash -85276967, now seen corresponding path program 1020 times [2020-02-10 19:53:15,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:15,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651961707] [2020-02-10 19:53:15,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:15,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651961707] [2020-02-10 19:53:15,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:15,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:15,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360150767] [2020-02-10 19:53:15,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:15,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:15,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:15,377 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:15,559 INFO L93 Difference]: Finished difference Result 1189 states and 4207 transitions. [2020-02-10 19:53:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:15,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:15,563 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:53:15,563 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:53:15,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:53:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 19:53:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:53:15,584 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:53:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:15,584 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:53:15,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:53:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:15,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:15,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:15,586 INFO L427 AbstractCegarLoop]: === Iteration 1028 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1945631101, now seen corresponding path program 1021 times [2020-02-10 19:53:15,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:15,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529324055] [2020-02-10 19:53:15,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:15,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 19:53:15,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529324055] [2020-02-10 19:53:15,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:15,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:15,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393616967] [2020-02-10 19:53:15,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:15,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:15,943 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:53:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:16,089 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 19:53:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:16,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:16,093 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:53:16,093 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:53:16,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:53:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-02-10 19:53:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 19:53:16,113 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 19:53:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:16,114 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 19:53:16,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 19:53:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:16,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:16,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:16,115 INFO L427 AbstractCegarLoop]: === Iteration 1029 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -943870175, now seen corresponding path program 1022 times [2020-02-10 19:53:16,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:16,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365500529] [2020-02-10 19:53:16,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:16,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365500529] [2020-02-10 19:53:16,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:16,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:16,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254455134] [2020-02-10 19:53:16,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:16,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:16,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:16,477 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:53:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:16,656 INFO L93 Difference]: Finished difference Result 1194 states and 4219 transitions. [2020-02-10 19:53:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:16,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:16,659 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:53:16,659 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:53:16,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:53:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 19:53:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:53:16,681 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:53:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:16,681 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:53:16,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:53:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:16,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:16,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:16,682 INFO L427 AbstractCegarLoop]: === Iteration 1030 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1906437055, now seen corresponding path program 1023 times [2020-02-10 19:53:16,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:16,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084566098] [2020-02-10 19:53:16,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:17,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 19:53:17,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084566098] [2020-02-10 19:53:17,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:17,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:17,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454068719] [2020-02-10 19:53:17,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:17,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:17,050 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:53:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:17,189 INFO L93 Difference]: Finished difference Result 1188 states and 4207 transitions. [2020-02-10 19:53:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:17,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:17,192 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:53:17,192 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:53:17,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:53:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 19:53:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:53:17,213 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:17,214 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:53:17,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:53:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:17,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:17,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] [2020-02-10 19:53:17,215 INFO L427 AbstractCegarLoop]: === Iteration 1031 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1365763107, now seen corresponding path program 1024 times [2020-02-10 19:53:17,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:17,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672487901] [2020-02-10 19:53:17,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:17,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672487901] [2020-02-10 19:53:17,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:17,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:17,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902647050] [2020-02-10 19:53:17,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:17,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:17,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:17,577 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:17,745 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-02-10 19:53:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:17,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:17,748 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:53:17,748 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:53:17,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:53:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 19:53:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:53:17,769 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:53:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:17,769 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:53:17,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:53:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:17,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:17,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:17,770 INFO L427 AbstractCegarLoop]: === Iteration 1032 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 697139907, now seen corresponding path program 1025 times [2020-02-10 19:53:17,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:17,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576529475] [2020-02-10 19:53:17,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:18,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576529475] [2020-02-10 19:53:18,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:18,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:18,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697844370] [2020-02-10 19:53:18,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:18,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:18,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:18,118 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:53:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:18,265 INFO L93 Difference]: Finished difference Result 1190 states and 4209 transitions. [2020-02-10 19:53:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:18,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:18,268 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:53:18,268 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:53:18,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:53:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:53:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:53:18,289 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:18,289 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:53:18,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:53:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:18,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:18,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:18,290 INFO L427 AbstractCegarLoop]: === Iteration 1033 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash -375945473, now seen corresponding path program 1026 times [2020-02-10 19:53:18,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:18,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930137175] [2020-02-10 19:53:18,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:18,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930137175] [2020-02-10 19:53:18,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:18,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:18,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54436093] [2020-02-10 19:53:18,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:18,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:18,646 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:18,812 INFO L93 Difference]: Finished difference Result 1187 states and 4201 transitions. [2020-02-10 19:53:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:18,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:18,815 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:18,815 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:53:18,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:53:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 19:53:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:53:18,836 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:53:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:18,836 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:53:18,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:53:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:18,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:18,837 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:18,837 INFO L427 AbstractCegarLoop]: === Iteration 1034 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash -24563171, now seen corresponding path program 1027 times [2020-02-10 19:53:18,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:18,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640648875] [2020-02-10 19:53:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:19,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 19:53:19,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640648875] [2020-02-10 19:53:19,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:19,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:19,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808334867] [2020-02-10 19:53:19,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:19,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:19,209 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:53:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,386 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-02-10 19:53:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:19,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,390 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:53:19,390 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:53:19,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:53:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 19:53:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:53:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 19:53:19,412 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 19:53:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,412 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 19:53:19,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 19:53:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:19,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:19,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:19,413 INFO L427 AbstractCegarLoop]: === Iteration 1035 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash 513292407, now seen corresponding path program 1028 times [2020-02-10 19:53:19,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:19,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824794847] [2020-02-10 19:53:19,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:19,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 19:53:19,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824794847] [2020-02-10 19:53:19,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:19,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:19,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911201625] [2020-02-10 19:53:19,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:19,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:19,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:19,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:19,772 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:53:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,909 INFO L93 Difference]: Finished difference Result 1200 states and 4230 transitions. [2020-02-10 19:53:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:19,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,912 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:53:19,913 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:53:19,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:53:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 19:53:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:53:19,934 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:53:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,934 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:53:19,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:53:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:19,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:19,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:19,936 INFO L427 AbstractCegarLoop]: === Iteration 1036 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1069528417, now seen corresponding path program 1029 times [2020-02-10 19:53:19,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:19,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810900141] [2020-02-10 19:53:19,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:20,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810900141] [2020-02-10 19:53:20,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:20,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:20,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205853194] [2020-02-10 19:53:20,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:20,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:20,282 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:53:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:20,459 INFO L93 Difference]: Finished difference Result 1195 states and 4220 transitions. [2020-02-10 19:53:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:20,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:20,463 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:53:20,463 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:53:20,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:53:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 19:53:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:53:20,484 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:20,484 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:53:20,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:53:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:20,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:20,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:20,485 INFO L427 AbstractCegarLoop]: === Iteration 1037 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 534298615, now seen corresponding path program 1030 times [2020-02-10 19:53:20,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:20,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756539852] [2020-02-10 19:53:20,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:20,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756539852] [2020-02-10 19:53:20,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:20,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:20,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225455410] [2020-02-10 19:53:20,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:20,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:20,829 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:21,022 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-02-10 19:53:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:21,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:21,025 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:53:21,026 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:53:21,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:53:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:53:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:53:21,047 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:53:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:21,048 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:53:21,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:53:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:21,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:21,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] [2020-02-10 19:53:21,049 INFO L427 AbstractCegarLoop]: === Iteration 1038 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1101037729, now seen corresponding path program 1031 times [2020-02-10 19:53:21,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:21,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161617479] [2020-02-10 19:53:21,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:21,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161617479] [2020-02-10 19:53:21,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:21,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:21,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613204725] [2020-02-10 19:53:21,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:21,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:21,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:21,395 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:53:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:21,573 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 19:53:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:21,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:21,576 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:53:21,576 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:53:21,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:53:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 19:53:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:53:21,597 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:53:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:21,597 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:53:21,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:53:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:21,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:21,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] [2020-02-10 19:53:21,599 INFO L427 AbstractCegarLoop]: === Iteration 1039 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash 27952349, now seen corresponding path program 1032 times [2020-02-10 19:53:21,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:21,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129024786] [2020-02-10 19:53:21,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:21,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129024786] [2020-02-10 19:53:21,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:21,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:21,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691193180] [2020-02-10 19:53:21,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:21,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:21,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:21,950 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:22,131 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-02-10 19:53:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:22,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:22,134 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:53:22,134 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:53:22,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:53:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2020-02-10 19:53:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:53:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 19:53:22,156 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 19:53:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:22,156 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 19:53:22,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 19:53:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:22,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:22,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:22,157 INFO L427 AbstractCegarLoop]: === Iteration 1040 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:22,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:22,158 INFO L82 PathProgramCache]: Analyzing trace with hash -24944675, now seen corresponding path program 1033 times [2020-02-10 19:53:22,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:22,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027200035] [2020-02-10 19:53:22,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:22,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 19:53:22,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027200035] [2020-02-10 19:53:22,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:22,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:22,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125456347] [2020-02-10 19:53:22,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:22,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:22,534 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 19:53:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:22,712 INFO L93 Difference]: Finished difference Result 1187 states and 4209 transitions. [2020-02-10 19:53:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:22,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:22,715 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:22,715 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:53:22,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:53:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-02-10 19:53:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 19:53:22,736 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 19:53:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:22,736 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 19:53:22,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 19:53:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:22,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:22,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:22,737 INFO L427 AbstractCegarLoop]: === Iteration 1041 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash 955810043, now seen corresponding path program 1034 times [2020-02-10 19:53:22,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:22,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641271529] [2020-02-10 19:53:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:23,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 19:53:23,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641271529] [2020-02-10 19:53:23,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:23,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990066615] [2020-02-10 19:53:23,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:23,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:23,123 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:53:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:23,300 INFO L93 Difference]: Finished difference Result 1186 states and 4204 transitions. [2020-02-10 19:53:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:23,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:23,303 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:53:23,304 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:53:23,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:53:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 776. [2020-02-10 19:53:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:53:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 19:53:23,325 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 19:53:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:23,325 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 19:53:23,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 19:53:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:23,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:23,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:23,326 INFO L427 AbstractCegarLoop]: === Iteration 1042 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash -467843815, now seen corresponding path program 1035 times [2020-02-10 19:53:23,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:23,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860397378] [2020-02-10 19:53:23,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:23,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 19:53:23,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860397378] [2020-02-10 19:53:23,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:23,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287319588] [2020-02-10 19:53:23,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:23,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:23,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:23,696 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:53:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:23,874 INFO L93 Difference]: Finished difference Result 1190 states and 4213 transitions. [2020-02-10 19:53:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:23,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:23,877 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:53:23,877 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:53:23,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:53:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 780. [2020-02-10 19:53:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:53:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 19:53:23,897 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 19:53:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:23,897 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 19:53:23,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 19:53:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:23,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:23,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:23,899 INFO L427 AbstractCegarLoop]: === Iteration 1043 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash 533917111, now seen corresponding path program 1036 times [2020-02-10 19:53:23,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:23,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872687247] [2020-02-10 19:53:23,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:24,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872687247] [2020-02-10 19:53:24,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:24,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:24,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062775983] [2020-02-10 19:53:24,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:24,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:24,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:24,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:24,279 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:53:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:24,417 INFO L93 Difference]: Finished difference Result 1191 states and 4211 transitions. [2020-02-10 19:53:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:24,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:24,420 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:53:24,420 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:53:24,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:53:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-02-10 19:53:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:53:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 19:53:24,441 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 19:53:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:24,441 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 19:53:24,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 19:53:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:24,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:24,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] [2020-02-10 19:53:24,442 INFO L427 AbstractCegarLoop]: === Iteration 1044 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1945627677, now seen corresponding path program 1037 times [2020-02-10 19:53:24,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:24,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169986851] [2020-02-10 19:53:24,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:24,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169986851] [2020-02-10 19:53:24,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:24,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:24,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028561201] [2020-02-10 19:53:24,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:24,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:24,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:24,808 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:53:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:24,982 INFO L93 Difference]: Finished difference Result 1187 states and 4203 transitions. [2020-02-10 19:53:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:24,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:24,999 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:24,999 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:53:24,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:53:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-02-10 19:53:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:53:25,019 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:25,020 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:53:25,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:53:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:25,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:25,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:25,021 INFO L427 AbstractCegarLoop]: === Iteration 1045 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash 872542297, now seen corresponding path program 1038 times [2020-02-10 19:53:25,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:25,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89801084] [2020-02-10 19:53:25,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:25,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89801084] [2020-02-10 19:53:25,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:25,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:25,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361169063] [2020-02-10 19:53:25,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:25,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:25,381 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:25,556 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-02-10 19:53:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:25,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:25,560 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:53:25,560 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:25,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 773. [2020-02-10 19:53:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:53:25,580 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:53:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:25,580 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:53:25,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:53:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:25,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:25,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] [2020-02-10 19:53:25,582 INFO L427 AbstractCegarLoop]: === Iteration 1046 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash -869916127, now seen corresponding path program 1039 times [2020-02-10 19:53:25,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:25,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813415464] [2020-02-10 19:53:25,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:25,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 19:53:25,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813415464] [2020-02-10 19:53:25,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:25,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:25,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199586727] [2020-02-10 19:53:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:25,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:25,958 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:53:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:26,132 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 19:53:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:26,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:26,136 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:53:26,136 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:53:26,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:53:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2020-02-10 19:53:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:53:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 19:53:26,157 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:26,157 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 19:53:26,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 19:53:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:26,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:26,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] [2020-02-10 19:53:26,158 INFO L427 AbstractCegarLoop]: === Iteration 1047 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash 110838591, now seen corresponding path program 1040 times [2020-02-10 19:53:26,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:26,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696117450] [2020-02-10 19:53:26,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:26,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 19:53:26,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696117450] [2020-02-10 19:53:26,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:26,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:26,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122328483] [2020-02-10 19:53:26,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:26,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:26,528 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:26,666 INFO L93 Difference]: Finished difference Result 1179 states and 4183 transitions. [2020-02-10 19:53:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:26,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:26,669 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:53:26,669 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:53:26,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:53:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 19:53:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:53:26,690 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:53:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:26,691 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:53:26,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:53:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:26,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:26,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:26,692 INFO L427 AbstractCegarLoop]: === Iteration 1048 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1755714407, now seen corresponding path program 1041 times [2020-02-10 19:53:26,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:26,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436512990] [2020-02-10 19:53:26,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:27,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436512990] [2020-02-10 19:53:27,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:27,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:27,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568369464] [2020-02-10 19:53:27,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:27,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:27,079 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:53:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:27,255 INFO L93 Difference]: Finished difference Result 1178 states and 4181 transitions. [2020-02-10 19:53:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:27,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:27,258 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 19:53:27,258 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:53:27,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:53:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 19:53:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:53:27,280 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:27,280 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:53:27,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:53:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:27,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:27,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:27,281 INFO L427 AbstractCegarLoop]: === Iteration 1049 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash -732947273, now seen corresponding path program 1042 times [2020-02-10 19:53:27,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:27,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309601290] [2020-02-10 19:53:27,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:27,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309601290] [2020-02-10 19:53:27,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:27,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:27,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301409441] [2020-02-10 19:53:27,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:27,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:27,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:27,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:27,648 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:27,777 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 19:53:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:27,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:27,780 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 19:53:27,780 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 19:53:27,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 19:53:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-02-10 19:53:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:53:27,802 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:53:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:27,803 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:53:27,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:53:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:27,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:27,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] [2020-02-10 19:53:27,804 INFO L427 AbstractCegarLoop]: === Iteration 1050 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:27,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848673, now seen corresponding path program 1043 times [2020-02-10 19:53:27,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:27,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000679287] [2020-02-10 19:53:27,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:28,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000679287] [2020-02-10 19:53:28,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:28,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:28,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471457323] [2020-02-10 19:53:28,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:28,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:28,175 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:53:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:28,313 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 19:53:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:28,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:28,316 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 19:53:28,316 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:53:28,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:53:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 777. [2020-02-10 19:53:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:53:28,338 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,338 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:53:28,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:53:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:28,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:28,339 INFO L427 AbstractCegarLoop]: === Iteration 1051 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -394322087, now seen corresponding path program 1044 times [2020-02-10 19:53:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998485180] [2020-02-10 19:53:28,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:28,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998485180] [2020-02-10 19:53:28,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:28,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:28,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283273648] [2020-02-10 19:53:28,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:28,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:28,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:28,712 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:28,837 INFO L93 Difference]: Finished difference Result 1175 states and 4171 transitions. [2020-02-10 19:53:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:28,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:28,839 INFO L225 Difference]: With dead ends: 1175 [2020-02-10 19:53:28,839 INFO L226 Difference]: Without dead ends: 1160 [2020-02-10 19:53:28,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-02-10 19:53:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 773. [2020-02-10 19:53:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:53:28,860 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:53:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,860 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:53:28,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:53:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:28,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:28,862 INFO L427 AbstractCegarLoop]: === Iteration 1052 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2137180577, now seen corresponding path program 1045 times [2020-02-10 19:53:28,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159897916] [2020-02-10 19:53:28,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:29,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159897916] [2020-02-10 19:53:29,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:29,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:29,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017865360] [2020-02-10 19:53:29,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:29,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:29,247 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:53:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:29,370 INFO L93 Difference]: Finished difference Result 1186 states and 4200 transitions. [2020-02-10 19:53:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:29,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:29,374 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:53:29,374 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:53:29,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:53:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 779. [2020-02-10 19:53:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:53:29,395 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:29,395 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:53:29,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:53:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:29,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:29,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:29,397 INFO L427 AbstractCegarLoop]: === Iteration 1053 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1156025793, now seen corresponding path program 1046 times [2020-02-10 19:53:29,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:29,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112017692] [2020-02-10 19:53:29,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:29,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112017692] [2020-02-10 19:53:29,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:29,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441311021] [2020-02-10 19:53:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:29,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:29,762 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:29,887 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-02-10 19:53:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:29,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:29,891 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:29,891 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:29,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 19:53:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:53:29,912 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:53:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:29,912 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:53:29,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:53:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:29,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:29,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:29,913 INFO L427 AbstractCegarLoop]: === Iteration 1054 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:29,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1694281437, now seen corresponding path program 1047 times [2020-02-10 19:53:29,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:29,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159330321] [2020-02-10 19:53:29,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:30,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 19:53:30,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159330321] [2020-02-10 19:53:30,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:30,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:30,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855137860] [2020-02-10 19:53:30,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:30,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:30,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:30,273 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:53:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:30,398 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 19:53:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:30,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:30,401 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:30,401 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:53:30,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:53:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 19:53:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:53:30,421 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:30,422 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:53:30,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:53:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:30,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:30,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] [2020-02-10 19:53:30,423 INFO L427 AbstractCegarLoop]: === Iteration 1055 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1577918725, now seen corresponding path program 1048 times [2020-02-10 19:53:30,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:30,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017109111] [2020-02-10 19:53:30,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:30,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017109111] [2020-02-10 19:53:30,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:30,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:30,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735029646] [2020-02-10 19:53:30,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:30,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:30,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:30,793 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:30,940 INFO L93 Difference]: Finished difference Result 1179 states and 4180 transitions. [2020-02-10 19:53:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:30,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:30,944 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:53:30,944 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:53:30,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:53:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 19:53:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:53:30,964 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:53:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:30,965 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:53:30,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:53:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:30,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:30,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:30,966 INFO L427 AbstractCegarLoop]: === Iteration 1056 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:30,966 INFO L82 PathProgramCache]: Analyzing trace with hash 484984289, now seen corresponding path program 1049 times [2020-02-10 19:53:30,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:30,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964057406] [2020-02-10 19:53:30,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,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 19:53:31,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964057406] [2020-02-10 19:53:31,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:31,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649374537] [2020-02-10 19:53:31,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:31,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:31,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:31,342 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:53:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:31,466 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 19:53:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:31,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:31,469 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:53:31,469 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:31,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 19:53:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:53:31,490 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:53:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:31,491 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:53:31,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:53:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:31,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:31,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:31,492 INFO L427 AbstractCegarLoop]: === Iteration 1057 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -588101091, now seen corresponding path program 1050 times [2020-02-10 19:53:31,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:31,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913155610] [2020-02-10 19:53:31,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:31,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913155610] [2020-02-10 19:53:31,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:31,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128864795] [2020-02-10 19:53:31,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:31,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:31,850 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:31,989 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 19:53:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:31,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:31,992 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:53:31,992 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:53:31,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:53:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 19:53:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:53:32,014 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:53:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,014 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:53:32,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:53:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:32,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:32,015 INFO L427 AbstractCegarLoop]: === Iteration 1058 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1277332667, now seen corresponding path program 1051 times [2020-02-10 19:53:32,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055940300] [2020-02-10 19:53:32,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:32,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055940300] [2020-02-10 19:53:32,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:32,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:32,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594673937] [2020-02-10 19:53:32,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:32,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:32,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:32,371 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:53:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:32,495 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 19:53:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:32,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:32,499 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:32,499 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:32,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 778. [2020-02-10 19:53:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:53:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 19:53:32,520 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,520 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 19:53:32,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 19:53:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:32,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:32,521 INFO L427 AbstractCegarLoop]: === Iteration 1059 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash 204247287, now seen corresponding path program 1052 times [2020-02-10 19:53:32,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746893745] [2020-02-10 19:53:32,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:32,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746893745] [2020-02-10 19:53:32,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:32,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:32,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668146511] [2020-02-10 19:53:32,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:32,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:32,885 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:33,019 INFO L93 Difference]: Finished difference Result 1183 states and 4187 transitions. [2020-02-10 19:53:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:33,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:33,023 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:53:33,023 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:53:33,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:53:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 19:53:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:53:33,044 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:53:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:33,044 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:53:33,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:53:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:33,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:33,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:33,045 INFO L427 AbstractCegarLoop]: === Iteration 1060 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1923543041, now seen corresponding path program 1053 times [2020-02-10 19:53:33,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:33,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860274703] [2020-02-10 19:53:33,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:33,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860274703] [2020-02-10 19:53:33,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:33,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:33,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19644231] [2020-02-10 19:53:33,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:33,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:33,420 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:53:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:33,540 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 19:53:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:33,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:33,543 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 19:53:33,543 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:53:33,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:53:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 19:53:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:53:33,565 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:53:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:33,565 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:53:33,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:53:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:33,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:33,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:33,566 INFO L427 AbstractCegarLoop]: === Iteration 1061 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash 225253495, now seen corresponding path program 1054 times [2020-02-10 19:53:33,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:33,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054116447] [2020-02-10 19:53:33,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:33,859 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2020-02-10 19:53:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:34,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054116447] [2020-02-10 19:53:34,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:34,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:34,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840486522] [2020-02-10 19:53:34,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:34,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:34,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:34,032 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:34,175 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-02-10 19:53:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:34,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:34,178 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 19:53:34,179 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 19:53:34,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 19:53:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-02-10 19:53:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:53:34,200 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:53:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:34,200 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:53:34,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:53:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:34,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:34,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:34,201 INFO L427 AbstractCegarLoop]: === Iteration 1062 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:34,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1902536833, now seen corresponding path program 1055 times [2020-02-10 19:53:34,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:34,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279025720] [2020-02-10 19:53:34,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:34,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279025720] [2020-02-10 19:53:34,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:34,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:34,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509388370] [2020-02-10 19:53:34,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:34,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:34,564 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:53:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:34,688 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-02-10 19:53:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:34,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:34,690 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:34,690 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:53:34,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:53:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 19:53:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:53:34,712 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:53:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:34,712 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:53:34,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:53:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:34,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:34,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:34,713 INFO L427 AbstractCegarLoop]: === Iteration 1063 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1319345083, now seen corresponding path program 1056 times [2020-02-10 19:53:34,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:34,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119324351] [2020-02-10 19:53:34,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,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 19:53:35,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119324351] [2020-02-10 19:53:35,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:35,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705601709] [2020-02-10 19:53:35,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:35,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:35,084 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:53:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:35,214 INFO L93 Difference]: Finished difference Result 1178 states and 4173 transitions. [2020-02-10 19:53:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:35,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:35,217 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 19:53:35,217 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 19:53:35,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 19:53:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-02-10 19:53:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:53:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 19:53:35,238 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 19:53:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:35,238 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 19:53:35,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 19:53:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:35,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:35,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:35,239 INFO L427 AbstractCegarLoop]: === Iteration 1064 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1231567229, now seen corresponding path program 1057 times [2020-02-10 19:53:35,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:35,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015807868] [2020-02-10 19:53:35,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:35,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015807868] [2020-02-10 19:53:35,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:35,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362216553] [2020-02-10 19:53:35,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:35,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:35,608 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 19:53:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:35,728 INFO L93 Difference]: Finished difference Result 1197 states and 4229 transitions. [2020-02-10 19:53:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:35,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:35,731 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:53:35,731 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:53:35,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:53:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 19:53:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:53:35,752 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:53:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:35,752 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:53:35,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:53:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:35,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:35,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:35,753 INFO L427 AbstractCegarLoop]: === Iteration 1065 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:35,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash 379373729, now seen corresponding path program 1058 times [2020-02-10 19:53:35,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:35,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266431517] [2020-02-10 19:53:35,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:36,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 19:53:36,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266431517] [2020-02-10 19:53:36,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:36,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:36,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724334850] [2020-02-10 19:53:36,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:36,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:36,112 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:53:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:36,232 INFO L93 Difference]: Finished difference Result 1194 states and 4220 transitions. [2020-02-10 19:53:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:36,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:36,236 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:53:36,236 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:53:36,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:53:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-02-10 19:53:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:53:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 19:53:36,258 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,258 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 19:53:36,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 19:53:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:36,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:36,259 INFO L427 AbstractCegarLoop]: === Iteration 1066 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -137475641, now seen corresponding path program 1059 times [2020-02-10 19:53:36,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503390975] [2020-02-10 19:53:36,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:36,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503390975] [2020-02-10 19:53:36,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:36,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:36,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170762678] [2020-02-10 19:53:36,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:36,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:36,620 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:36,738 INFO L93 Difference]: Finished difference Result 1201 states and 4236 transitions. [2020-02-10 19:53:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:36,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:36,742 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:53:36,742 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:53:36,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:53:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 781. [2020-02-10 19:53:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:53:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3103 transitions. [2020-02-10 19:53:36,763 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3103 transitions. Word has length 25 [2020-02-10 19:53:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,763 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3103 transitions. [2020-02-10 19:53:36,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3103 transitions. [2020-02-10 19:53:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:36,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:36,764 INFO L427 AbstractCegarLoop]: === Iteration 1067 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash 400379937, now seen corresponding path program 1060 times [2020-02-10 19:53:36,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132147183] [2020-02-10 19:53:36,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:37,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132147183] [2020-02-10 19:53:37,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:37,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:37,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069137554] [2020-02-10 19:53:37,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:37,121 INFO L87 Difference]: Start difference. First operand 781 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:53:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:37,243 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 19:53:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:37,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:37,246 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:53:37,247 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:53:37,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:53:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-02-10 19:53:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:53:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 19:53:37,268 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 19:53:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:37,268 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 19:53:37,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 19:53:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:37,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:37,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] [2020-02-10 19:53:37,269 INFO L427 AbstractCegarLoop]: === Iteration 1068 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash -126972537, now seen corresponding path program 1061 times [2020-02-10 19:53:37,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:37,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660517229] [2020-02-10 19:53:37,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:37,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660517229] [2020-02-10 19:53:37,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:37,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:37,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579182015] [2020-02-10 19:53:37,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:37,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:37,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:37,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:37,639 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:53:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:37,764 INFO L93 Difference]: Finished difference Result 1193 states and 4215 transitions. [2020-02-10 19:53:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:37,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:37,767 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:53:37,767 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:53:37,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:53:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 19:53:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:53:37,788 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:53:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:37,788 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:53:37,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:53:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:37,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:37,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:37,790 INFO L427 AbstractCegarLoop]: === Iteration 1069 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1200057917, now seen corresponding path program 1062 times [2020-02-10 19:53:37,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:37,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329242179] [2020-02-10 19:53:37,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:38,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 19:53:38,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329242179] [2020-02-10 19:53:38,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:38,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:38,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172037039] [2020-02-10 19:53:38,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:38,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:38,154 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:53:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:38,273 INFO L93 Difference]: Finished difference Result 1195 states and 4216 transitions. [2020-02-10 19:53:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:38,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:38,276 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:53:38,276 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:53:38,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:53:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 19:53:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:53:38,296 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:53:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:38,297 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:53:38,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:53:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:38,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:38,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:38,298 INFO L427 AbstractCegarLoop]: === Iteration 1070 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1674466369, now seen corresponding path program 1063 times [2020-02-10 19:53:38,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:38,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542265552] [2020-02-10 19:53:38,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:38,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542265552] [2020-02-10 19:53:38,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:38,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:38,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439621163] [2020-02-10 19:53:38,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:38,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:38,658 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:53:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:38,782 INFO L93 Difference]: Finished difference Result 1189 states and 4205 transitions. [2020-02-10 19:53:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:38,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:38,785 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:53:38,786 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:53:38,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:53:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-02-10 19:53:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:53:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:53:38,807 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:53:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:38,807 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:53:38,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:53:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:38,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:38,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:38,808 INFO L427 AbstractCegarLoop]: === Iteration 1071 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -63525411, now seen corresponding path program 1064 times [2020-02-10 19:53:38,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:38,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561793023] [2020-02-10 19:53:38,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:39,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561793023] [2020-02-10 19:53:39,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:39,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:39,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925502144] [2020-02-10 19:53:39,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:39,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:39,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:39,174 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:53:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,313 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 19:53:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:39,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,316 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:53:39,316 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:53:39,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:53:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 19:53:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:53:39,336 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:53:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:39,336 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:53:39,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:53:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:39,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:39,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:39,337 INFO L427 AbstractCegarLoop]: === Iteration 1072 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:39,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:39,338 INFO L82 PathProgramCache]: Analyzing trace with hash 513716807, now seen corresponding path program 1065 times [2020-02-10 19:53:39,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:39,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235741880] [2020-02-10 19:53:39,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:39,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235741880] [2020-02-10 19:53:39,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:39,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:39,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971979212] [2020-02-10 19:53:39,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:39,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:39,685 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:53:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,803 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-02-10 19:53:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:39,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,807 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:39,807 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:53:39,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:53:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 19:53:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:53:39,828 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:39,828 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:53:39,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:53:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:39,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:39,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:39,829 INFO L427 AbstractCegarLoop]: === Iteration 1073 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash -21512995, now seen corresponding path program 1066 times [2020-02-10 19:53:39,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:39,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687380616] [2020-02-10 19:53:39,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:40,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687380616] [2020-02-10 19:53:40,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:40,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:40,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473569208] [2020-02-10 19:53:40,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:40,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:40,183 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:40,329 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 19:53:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:40,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:40,333 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:53:40,333 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:53:40,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:53:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 19:53:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:53:40,354 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:53:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:40,354 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:53:40,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:53:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:40,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:40,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:40,355 INFO L427 AbstractCegarLoop]: === Iteration 1074 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 524219911, now seen corresponding path program 1067 times [2020-02-10 19:53:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765988049] [2020-02-10 19:53:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:40,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765988049] [2020-02-10 19:53:40,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:40,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:40,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681003784] [2020-02-10 19:53:40,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:40,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:40,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:40,729 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:53:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:40,853 INFO L93 Difference]: Finished difference Result 1181 states and 4184 transitions. [2020-02-10 19:53:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:40,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:40,856 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:40,856 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:40,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 19:53:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:53:40,878 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:53:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:40,878 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:53:40,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:53:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:40,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:40,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:40,879 INFO L427 AbstractCegarLoop]: === Iteration 1075 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1621950849, now seen corresponding path program 1068 times [2020-02-10 19:53:40,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:40,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194361533] [2020-02-10 19:53:40,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:41,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 19:53:41,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194361533] [2020-02-10 19:53:41,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:41,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:41,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138249463] [2020-02-10 19:53:41,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:41,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:41,253 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:41,383 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 19:53:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:41,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:41,386 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:53:41,386 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:53:41,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:53:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 19:53:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:53:41,408 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:53:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:41,408 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:53:41,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:53:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:41,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:41,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:41,409 INFO L427 AbstractCegarLoop]: === Iteration 1076 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1023273921, now seen corresponding path program 1069 times [2020-02-10 19:53:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:41,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644378826] [2020-02-10 19:53:41,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:41,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644378826] [2020-02-10 19:53:41,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:41,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:41,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521796241] [2020-02-10 19:53:41,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:41,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:41,769 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:53:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:41,893 INFO L93 Difference]: Finished difference Result 1197 states and 4223 transitions. [2020-02-10 19:53:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:41,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:41,897 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:53:41,897 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:53:41,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:53:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 780. [2020-02-10 19:53:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:53:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-02-10 19:53:41,919 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:41,919 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-02-10 19:53:41,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-02-10 19:53:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:41,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:41,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:41,920 INFO L427 AbstractCegarLoop]: === Iteration 1077 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -485418343, now seen corresponding path program 1070 times [2020-02-10 19:53:41,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:41,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323031014] [2020-02-10 19:53:41,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:42,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323031014] [2020-02-10 19:53:42,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:42,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:42,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933108293] [2020-02-10 19:53:42,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:42,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:42,278 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:42,402 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-02-10 19:53:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:42,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:42,405 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:53:42,406 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:53:42,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:53:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 19:53:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:53:42,427 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:53:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:42,427 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:53:42,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:53:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:42,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:42,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] [2020-02-10 19:53:42,428 INFO L427 AbstractCegarLoop]: === Iteration 1078 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 70817667, now seen corresponding path program 1071 times [2020-02-10 19:53:42,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:42,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239488359] [2020-02-10 19:53:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:42,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239488359] [2020-02-10 19:53:42,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:42,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:42,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768800043] [2020-02-10 19:53:42,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:42,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:42,775 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:53:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:42,907 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-02-10 19:53:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:42,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:42,911 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:53:42,911 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:53:42,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:53:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:53:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:53:42,932 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:53:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:42,932 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:53:42,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:53:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:42,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:42,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:42,933 INFO L427 AbstractCegarLoop]: === Iteration 1079 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash -464412135, now seen corresponding path program 1072 times [2020-02-10 19:53:42,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:42,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804999883] [2020-02-10 19:53:42,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:43,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804999883] [2020-02-10 19:53:43,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:43,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470378859] [2020-02-10 19:53:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:43,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:43,285 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,432 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-02-10 19:53:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:43,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:43,435 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:53:43,435 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:53:43,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:53:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 19:53:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:53:43,456 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:53:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:43,456 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:53:43,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:53:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:43,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:43,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:43,458 INFO L427 AbstractCegarLoop]: === Iteration 1080 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 102326979, now seen corresponding path program 1073 times [2020-02-10 19:53:43,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:43,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051888458] [2020-02-10 19:53:43,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:43,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051888458] [2020-02-10 19:53:43,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:43,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037131375] [2020-02-10 19:53:43,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:43,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:43,812 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:53:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,939 INFO L93 Difference]: Finished difference Result 1189 states and 4200 transitions. [2020-02-10 19:53:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:43,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:43,943 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:53:43,943 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:53:43,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:53:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 19:53:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:53:43,964 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:53:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:43,965 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:53:43,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:53:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:43,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:43,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:43,966 INFO L427 AbstractCegarLoop]: === Iteration 1081 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash -970758401, now seen corresponding path program 1074 times [2020-02-10 19:53:43,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:43,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488508165] [2020-02-10 19:53:43,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:44,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 19:53:44,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488508165] [2020-02-10 19:53:44,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:44,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:44,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196455512] [2020-02-10 19:53:44,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:44,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:44,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:44,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:44,321 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:53:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:44,477 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-02-10 19:53:44,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:44,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:44,481 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:53:44,481 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:53:44,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:53:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 19:53:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:53:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:53:44,502 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:53:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:44,502 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:53:44,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:53:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:44,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:44,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:44,504 INFO L427 AbstractCegarLoop]: === Iteration 1082 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash 913263261, now seen corresponding path program 1075 times [2020-02-10 19:53:44,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:44,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610934217] [2020-02-10 19:53:44,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:44,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610934217] [2020-02-10 19:53:44,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:44,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:44,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717084946] [2020-02-10 19:53:44,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:44,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:44,854 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:53:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:44,980 INFO L93 Difference]: Finished difference Result 1184 states and 4191 transitions. [2020-02-10 19:53:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:44,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:44,983 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:53:44,983 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:53:44,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:53:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 19:53:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:53:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 19:53:45,005 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 19:53:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:45,005 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 19:53:45,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 19:53:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:45,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:45,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:45,006 INFO L427 AbstractCegarLoop]: === Iteration 1083 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash -159822119, now seen corresponding path program 1076 times [2020-02-10 19:53:45,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:45,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908167428] [2020-02-10 19:53:45,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:45,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908167428] [2020-02-10 19:53:45,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:45,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:45,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731341150] [2020-02-10 19:53:45,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:45,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:45,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:45,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:45,360 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:53:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:45,486 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-02-10 19:53:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:45,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:45,490 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:53:45,490 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:53:45,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:53:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 19:53:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:53:45,511 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:53:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:45,511 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:53:45,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:53:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:45,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:45,513 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:45,513 INFO L427 AbstractCegarLoop]: === Iteration 1084 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2007354849, now seen corresponding path program 1077 times [2020-02-10 19:53:45,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:45,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631520695] [2020-02-10 19:53:45,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:45,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631520695] [2020-02-10 19:53:45,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:45,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:45,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651797282] [2020-02-10 19:53:45,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:45,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:45,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:45,873 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:53:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:45,996 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 19:53:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:45,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:46,000 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:53:46,000 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:53:46,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:53:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 19:53:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:53:46,031 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:53:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:46,032 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:53:46,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:53:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:46,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:46,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:46,033 INFO L427 AbstractCegarLoop]: === Iteration 1085 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -138815911, now seen corresponding path program 1078 times [2020-02-10 19:53:46,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:46,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136549247] [2020-02-10 19:53:46,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:46,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 19:53:46,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136549247] [2020-02-10 19:53:46,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:46,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:46,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665450339] [2020-02-10 19:53:46,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:46,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:46,393 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:53:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:46,537 INFO L93 Difference]: Finished difference Result 1179 states and 4176 transitions. [2020-02-10 19:53:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:46,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:46,541 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:53:46,541 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:53:46,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:53:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 19:53:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:53:46,562 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:53:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:46,562 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:53:46,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:53:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:46,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:46,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] [2020-02-10 19:53:46,563 INFO L427 AbstractCegarLoop]: === Iteration 1086 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:46,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2028361057, now seen corresponding path program 1079 times [2020-02-10 19:53:46,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:46,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498690620] [2020-02-10 19:53:46,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:46,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498690620] [2020-02-10 19:53:46,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:46,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:46,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634596935] [2020-02-10 19:53:46,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:46,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:46,915 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:53:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:47,042 INFO L93 Difference]: Finished difference Result 1184 states and 4186 transitions. [2020-02-10 19:53:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:47,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:47,046 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:53:47,046 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:53:47,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:53:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:53:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:53:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:53:47,067 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:53:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:47,068 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:53:47,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:53:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:47,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:47,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:47,069 INFO L427 AbstractCegarLoop]: === Iteration 1087 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 955275677, now seen corresponding path program 1080 times [2020-02-10 19:53:47,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:47,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463347095] [2020-02-10 19:53:47,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:47,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463347095] [2020-02-10 19:53:47,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:47,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:47,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764417618] [2020-02-10 19:53:47,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:47,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:47,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:47,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:47,425 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:53:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:47,581 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-02-10 19:53:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:47,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:47,584 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:53:47,584 INFO L226 Difference]: Without dead ends: 1162 [2020-02-10 19:53:47,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-02-10 19:53:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 769. [2020-02-10 19:53:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 19:53:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3072 transitions. [2020-02-10 19:53:47,605 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3072 transitions. Word has length 25 [2020-02-10 19:53:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:47,605 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3072 transitions. [2020-02-10 19:53:47,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3072 transitions. [2020-02-10 19:53:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:47,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:47,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:47,606 INFO L427 AbstractCegarLoop]: === Iteration 1088 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1755725605, now seen corresponding path program 1081 times [2020-02-10 19:53:47,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:47,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229628999] [2020-02-10 19:53:47,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:47,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229628999] [2020-02-10 19:53:47,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:47,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:47,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12020381] [2020-02-10 19:53:47,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:47,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:47,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:47,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:47,951 INFO L87 Difference]: Start difference. First operand 769 states and 3072 transitions. Second operand 10 states. [2020-02-10 19:53:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:48,078 INFO L93 Difference]: Finished difference Result 1246 states and 4389 transitions. [2020-02-10 19:53:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:48,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:48,082 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:53:48,082 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 19:53:48,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 19:53:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 783. [2020-02-10 19:53:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:53:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-02-10 19:53:48,104 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-02-10 19:53:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:48,104 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-02-10 19:53:48,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-02-10 19:53:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:48,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:48,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:48,105 INFO L427 AbstractCegarLoop]: === Iteration 1089 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1568990077, now seen corresponding path program 1082 times [2020-02-10 19:53:48,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:48,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829566687] [2020-02-10 19:53:48,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:48,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829566687] [2020-02-10 19:53:48,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:48,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:48,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146166782] [2020-02-10 19:53:48,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:48,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:48,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:48,453 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-02-10 19:53:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:48,581 INFO L93 Difference]: Finished difference Result 1248 states and 4389 transitions. [2020-02-10 19:53:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:48,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:48,584 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:53:48,584 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 19:53:48,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 19:53:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 779. [2020-02-10 19:53:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-02-10 19:53:48,606 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-02-10 19:53:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:48,606 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-02-10 19:53:48,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-02-10 19:53:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:48,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:48,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:48,607 INFO L427 AbstractCegarLoop]: === Iteration 1090 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1312826465, now seen corresponding path program 1083 times [2020-02-10 19:53:48,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:48,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544678415] [2020-02-10 19:53:48,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:48,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544678415] [2020-02-10 19:53:48,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:48,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:48,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680126430] [2020-02-10 19:53:48,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:48,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:48,962 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:53:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:49,095 INFO L93 Difference]: Finished difference Result 1247 states and 4387 transitions. [2020-02-10 19:53:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:49,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:49,099 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 19:53:49,099 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 19:53:49,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 19:53:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-02-10 19:53:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:53:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-02-10 19:53:49,124 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-02-10 19:53:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:49,124 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-02-10 19:53:49,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-02-10 19:53:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:49,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:49,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:49,126 INFO L427 AbstractCegarLoop]: === Iteration 1091 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1990883009, now seen corresponding path program 1084 times [2020-02-10 19:53:49,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:49,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786332385] [2020-02-10 19:53:49,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:49,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 19:53:49,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786332385] [2020-02-10 19:53:49,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:49,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:49,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879405995] [2020-02-10 19:53:49,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:49,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:49,483 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:53:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:49,647 INFO L93 Difference]: Finished difference Result 1250 states and 4389 transitions. [2020-02-10 19:53:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:49,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:49,651 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:53:49,651 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:53:49,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:53:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-02-10 19:53:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-02-10 19:53:49,673 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-02-10 19:53:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:49,673 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-02-10 19:53:49,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-02-10 19:53:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:49,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:49,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] [2020-02-10 19:53:49,674 INFO L427 AbstractCegarLoop]: === Iteration 1092 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash -904768667, now seen corresponding path program 1085 times [2020-02-10 19:53:49,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:49,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470620657] [2020-02-10 19:53:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:50,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 19:53:50,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470620657] [2020-02-10 19:53:50,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:50,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:50,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326087118] [2020-02-10 19:53:50,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:50,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:50,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:50,027 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:53:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:50,154 INFO L93 Difference]: Finished difference Result 1253 states and 4397 transitions. [2020-02-10 19:53:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:50,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:50,158 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 19:53:50,158 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 19:53:50,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 19:53:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 785. [2020-02-10 19:53:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:53:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-02-10 19:53:50,180 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-02-10 19:53:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:50,180 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-02-10 19:53:50,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-02-10 19:53:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:50,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:50,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:50,181 INFO L427 AbstractCegarLoop]: === Iteration 1093 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1977854047, now seen corresponding path program 1086 times [2020-02-10 19:53:50,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:50,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186192099] [2020-02-10 19:53:50,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:50,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186192099] [2020-02-10 19:53:50,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:50,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:50,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462970703] [2020-02-10 19:53:50,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:50,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:50,547 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:53:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:50,674 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-02-10 19:53:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:50,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:50,677 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 19:53:50,677 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:53:50,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:53:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 775. [2020-02-10 19:53:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3098 transitions. [2020-02-10 19:53:50,699 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3098 transitions. Word has length 25 [2020-02-10 19:53:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:50,699 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3098 transitions. [2020-02-10 19:53:50,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3098 transitions. [2020-02-10 19:53:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:50,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:50,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:50,701 INFO L427 AbstractCegarLoop]: === Iteration 1094 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1333239879, now seen corresponding path program 1087 times [2020-02-10 19:53:50,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:50,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793216343] [2020-02-10 19:53:50,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:51,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 19:53:51,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793216343] [2020-02-10 19:53:51,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:51,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:51,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723158470] [2020-02-10 19:53:51,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:51,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:51,053 INFO L87 Difference]: Start difference. First operand 775 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:53:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:51,176 INFO L93 Difference]: Finished difference Result 1243 states and 4378 transitions. [2020-02-10 19:53:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:51,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:51,179 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:53:51,179 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:53:51,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:53:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 19:53:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:53:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-02-10 19:53:51,201 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-02-10 19:53:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:51,201 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-02-10 19:53:51,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-02-10 19:53:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:51,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:51,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:51,202 INFO L427 AbstractCegarLoop]: === Iteration 1095 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1991475803, now seen corresponding path program 1088 times [2020-02-10 19:53:51,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:51,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249684036] [2020-02-10 19:53:51,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:51,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249684036] [2020-02-10 19:53:51,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:51,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:51,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008419949] [2020-02-10 19:53:51,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:51,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:51,552 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:53:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:51,681 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-02-10 19:53:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:51,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:51,685 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 19:53:51,685 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:53:51,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:53:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 19:53:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-02-10 19:53:51,706 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-02-10 19:53:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:51,706 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-02-10 19:53:51,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-02-10 19:53:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:51,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:51,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:51,708 INFO L427 AbstractCegarLoop]: === Iteration 1096 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1478592479, now seen corresponding path program 1089 times [2020-02-10 19:53:51,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:51,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989524311] [2020-02-10 19:53:51,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:52,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989524311] [2020-02-10 19:53:52,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:52,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:52,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967932922] [2020-02-10 19:53:52,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:52,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:52,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:52,076 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:53:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:52,199 INFO L93 Difference]: Finished difference Result 1242 states and 4372 transitions. [2020-02-10 19:53:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:52,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:52,202 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 19:53:52,202 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 19:53:52,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 19:53:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-02-10 19:53:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:53:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 19:53:52,224 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 19:53:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:52,224 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 19:53:52,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 19:53:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:52,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:52,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:52,225 INFO L427 AbstractCegarLoop]: === Iteration 1097 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash -476831553, now seen corresponding path program 1090 times [2020-02-10 19:53:52,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:52,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363098854] [2020-02-10 19:53:52,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:52,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363098854] [2020-02-10 19:53:52,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:52,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:52,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610494865] [2020-02-10 19:53:52,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:52,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:52,584 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:53:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:52,731 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-02-10 19:53:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:52,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:52,735 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:53:52,735 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:53:52,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:53:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 779. [2020-02-10 19:53:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 19:53:52,756 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 19:53:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:52,756 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 19:53:52,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 19:53:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:52,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:52,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:52,757 INFO L427 AbstractCegarLoop]: === Iteration 1098 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1001658169, now seen corresponding path program 1091 times [2020-02-10 19:53:52,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:52,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025418369] [2020-02-10 19:53:52,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:53,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025418369] [2020-02-10 19:53:53,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:53,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:53,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480972923] [2020-02-10 19:53:53,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:53,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:53,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:53,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:53,122 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:53:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:53,245 INFO L93 Difference]: Finished difference Result 1247 states and 4379 transitions. [2020-02-10 19:53:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:53,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:53,249 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 19:53:53,249 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:53:53,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:53:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 784. [2020-02-10 19:53:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:53:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-02-10 19:53:53,270 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-02-10 19:53:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:53,270 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-02-10 19:53:53,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-02-10 19:53:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:53,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:53,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:53,271 INFO L427 AbstractCegarLoop]: === Iteration 1099 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash -463802591, now seen corresponding path program 1092 times [2020-02-10 19:53:53,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:53,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252598940] [2020-02-10 19:53:53,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:53,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252598940] [2020-02-10 19:53:53,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:53,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:53,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484482803] [2020-02-10 19:53:53,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:53,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:53,628 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:53:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:53,754 INFO L93 Difference]: Finished difference Result 1246 states and 4372 transitions. [2020-02-10 19:53:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:53,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:53,757 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 19:53:53,758 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:53:53,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:53:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 775. [2020-02-10 19:53:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 19:53:53,779 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 19:53:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:53,779 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 19:53:53,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 19:53:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:53,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:53,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:53,780 INFO L427 AbstractCegarLoop]: === Iteration 1100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 45369287, now seen corresponding path program 1093 times [2020-02-10 19:53:53,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:53,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16930710] [2020-02-10 19:53:53,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:54,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16930710] [2020-02-10 19:53:54,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:54,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:54,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565097417] [2020-02-10 19:53:54,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:54,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:54,128 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:53:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:54,269 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-02-10 19:53:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:54,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,273 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 19:53:54,273 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 19:53:54,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 19:53:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 19:53:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:53:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 19:53:54,416 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 19:53:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:54,416 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 19:53:54,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 19:53:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:54,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:54,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] [2020-02-10 19:53:54,418 INFO L427 AbstractCegarLoop]: === Iteration 1101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1036627109, now seen corresponding path program 1094 times [2020-02-10 19:53:54,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:54,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413686483] [2020-02-10 19:53:54,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:54,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413686483] [2020-02-10 19:53:54,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:54,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:54,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451395697] [2020-02-10 19:53:54,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:54,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:54,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:54,769 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 19:53:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:54,893 INFO L93 Difference]: Finished difference Result 1248 states and 4380 transitions. [2020-02-10 19:53:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:54,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,897 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:53:54,897 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 19:53:54,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 19:53:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-02-10 19:53:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 19:53:54,920 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 19:53:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:54,920 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 19:53:54,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 19:53:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:54,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:54,921 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:54,921 INFO L427 AbstractCegarLoop]: === Iteration 1102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1971403365, now seen corresponding path program 1095 times [2020-02-10 19:53:54,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:54,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066096813] [2020-02-10 19:53:54,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:55,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 19:53:55,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066096813] [2020-02-10 19:53:55,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:55,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:55,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134388138] [2020-02-10 19:53:55,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:55,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:55,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:55,293 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:53:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:55,413 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-02-10 19:53:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:55,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:55,417 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 19:53:55,417 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 19:53:55,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 19:53:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 19:53:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:53:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 19:53:55,438 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 19:53:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:55,438 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 19:53:55,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 19:53:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:55,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:55,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:55,439 INFO L427 AbstractCegarLoop]: === Iteration 1103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1321803005, now seen corresponding path program 1096 times [2020-02-10 19:53:55,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:55,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162588444] [2020-02-10 19:53:55,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:55,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162588444] [2020-02-10 19:53:55,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:55,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:55,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546943034] [2020-02-10 19:53:55,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:55,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:55,803 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:53:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:55,933 INFO L93 Difference]: Finished difference Result 1244 states and 4368 transitions. [2020-02-10 19:53:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:55,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:55,936 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 19:53:55,937 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:53:55,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:53:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 19:53:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:53:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 19:53:55,958 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 19:53:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:55,959 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 19:53:55,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 19:53:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:55,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:55,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:55,960 INFO L427 AbstractCegarLoop]: === Iteration 1104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2026444743, now seen corresponding path program 1097 times [2020-02-10 19:53:55,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:55,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811709517] [2020-02-10 19:53:55,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:56,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 19:53:56,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811709517] [2020-02-10 19:53:56,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:56,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:56,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345154057] [2020-02-10 19:53:56,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:56,307 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:53:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:56,431 INFO L93 Difference]: Finished difference Result 1250 states and 4381 transitions. [2020-02-10 19:53:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:56,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:56,435 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 19:53:56,435 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 19:53:56,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 19:53:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2020-02-10 19:53:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:53:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 19:53:56,457 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 19:53:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:56,457 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 19:53:56,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 19:53:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:56,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:56,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:56,458 INFO L427 AbstractCegarLoop]: === Iteration 1105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash -657581595, now seen corresponding path program 1098 times [2020-02-10 19:53:56,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489634140] [2020-02-10 19:53:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:56,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489634140] [2020-02-10 19:53:56,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:56,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:56,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977933731] [2020-02-10 19:53:56,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:56,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:56,808 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:53:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:56,941 INFO L93 Difference]: Finished difference Result 1248 states and 4372 transitions. [2020-02-10 19:53:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:56,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:56,944 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 19:53:56,944 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 19:53:56,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 19:53:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-02-10 19:53:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:53:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3090 transitions. [2020-02-10 19:53:56,966 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3090 transitions. Word has length 25 [2020-02-10 19:53:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:56,966 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3090 transitions. [2020-02-10 19:53:56,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3090 transitions. [2020-02-10 19:53:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:56,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:56,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:56,967 INFO L427 AbstractCegarLoop]: === Iteration 1106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -285193085, now seen corresponding path program 1099 times [2020-02-10 19:53:56,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:56,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014887177] [2020-02-10 19:53:56,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:57,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014887177] [2020-02-10 19:53:57,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:57,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:57,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834430038] [2020-02-10 19:53:57,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:57,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:57,333 INFO L87 Difference]: Start difference. First operand 775 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:53:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:57,462 INFO L93 Difference]: Finished difference Result 1257 states and 4405 transitions. [2020-02-10 19:53:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:57,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:57,465 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 19:53:57,466 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 19:53:57,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 19:53:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 786. [2020-02-10 19:53:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 19:53:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-02-10 19:53:57,487 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-02-10 19:53:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:57,487 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-02-10 19:53:57,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-02-10 19:53:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:57,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:57,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:57,489 INFO L427 AbstractCegarLoop]: === Iteration 1107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1358278465, now seen corresponding path program 1100 times [2020-02-10 19:53:57,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:57,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098825153] [2020-02-10 19:53:57,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:57,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098825153] [2020-02-10 19:53:57,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:57,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:57,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671304712] [2020-02-10 19:53:57,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:57,850 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-02-10 19:53:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:57,970 INFO L93 Difference]: Finished difference Result 1258 states and 4401 transitions. [2020-02-10 19:53:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:57,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:57,973 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 19:53:57,973 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 19:53:57,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 19:53:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 780. [2020-02-10 19:53:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:53:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3104 transitions. [2020-02-10 19:53:57,995 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3104 transitions. Word has length 25 [2020-02-10 19:53:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:57,995 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3104 transitions. [2020-02-10 19:53:57,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3104 transitions. [2020-02-10 19:53:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:57,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:57,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:57,996 INFO L427 AbstractCegarLoop]: === Iteration 1108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:57,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1885630939, now seen corresponding path program 1101 times [2020-02-10 19:53:57,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:57,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268214465] [2020-02-10 19:53:57,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:58,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 19:53:58,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268214465] [2020-02-10 19:53:58,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:58,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:58,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551990159] [2020-02-10 19:53:58,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:58,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:58,351 INFO L87 Difference]: Start difference. First operand 780 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:53:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:58,487 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-02-10 19:53:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:58,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:58,490 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 19:53:58,490 INFO L226 Difference]: Without dead ends: 1239 [2020-02-10 19:53:58,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-02-10 19:53:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 785. [2020-02-10 19:53:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:53:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3113 transitions. [2020-02-10 19:53:58,511 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3113 transitions. Word has length 25 [2020-02-10 19:53:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:58,511 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3113 transitions. [2020-02-10 19:53:58,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3113 transitions. [2020-02-10 19:53:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:58,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:58,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] [2020-02-10 19:53:58,513 INFO L427 AbstractCegarLoop]: === Iteration 1109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1347775361, now seen corresponding path program 1102 times [2020-02-10 19:53:58,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:58,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456459107] [2020-02-10 19:53:58,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:58,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456459107] [2020-02-10 19:53:58,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:58,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:58,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964130458] [2020-02-10 19:53:58,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:58,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:58,876 INFO L87 Difference]: Start difference. First operand 785 states and 3113 transitions. Second operand 10 states. [2020-02-10 19:53:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:58,999 INFO L93 Difference]: Finished difference Result 1253 states and 4386 transitions. [2020-02-10 19:53:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:58,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:59,002 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 19:53:59,002 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 19:53:59,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 19:53:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 780. [2020-02-10 19:53:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:53:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-02-10 19:53:59,024 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-02-10 19:53:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:59,024 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-02-10 19:53:59,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-02-10 19:53:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:59,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:59,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:59,026 INFO L427 AbstractCegarLoop]: === Iteration 1110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1864624731, now seen corresponding path program 1103 times [2020-02-10 19:53:59,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:59,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149307701] [2020-02-10 19:53:59,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:59,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 19:53:59,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149307701] [2020-02-10 19:53:59,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:59,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:59,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915793138] [2020-02-10 19:53:59,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:59,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:59,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:59,381 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:53:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:59,496 INFO L93 Difference]: Finished difference Result 1256 states and 4392 transitions. [2020-02-10 19:53:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:53:59,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:53:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:59,500 INFO L225 Difference]: With dead ends: 1256 [2020-02-10 19:53:59,500 INFO L226 Difference]: Without dead ends: 1240 [2020-02-10 19:53:59,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-02-10 19:53:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 785. [2020-02-10 19:53:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:53:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3108 transitions. [2020-02-10 19:53:59,522 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3108 transitions. Word has length 25 [2020-02-10 19:53:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:59,522 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3108 transitions. [2020-02-10 19:53:59,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:53:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3108 transitions. [2020-02-10 19:53:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:53:59,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:59,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:59,523 INFO L427 AbstractCegarLoop]: === Iteration 1111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash -253683773, now seen corresponding path program 1104 times [2020-02-10 19:53:59,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:59,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302826877] [2020-02-10 19:53:59,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:59,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302826877] [2020-02-10 19:53:59,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:59,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:53:59,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566788027] [2020-02-10 19:53:59,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:53:59,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:59,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:53:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:53:59,880 INFO L87 Difference]: Start difference. First operand 785 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:54:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,020 INFO L93 Difference]: Finished difference Result 1254 states and 4383 transitions. [2020-02-10 19:54:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:00,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,023 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 19:54:00,023 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:54:00,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:54:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 771. [2020-02-10 19:54:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:54:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 19:54:00,045 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 19:54:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:00,045 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 19:54:00,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 19:54:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:00,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:00,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] [2020-02-10 19:54:00,046 INFO L427 AbstractCegarLoop]: === Iteration 1112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:00,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1331414369, now seen corresponding path program 1105 times [2020-02-10 19:54:00,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:00,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313104790] [2020-02-10 19:54:00,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:00,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313104790] [2020-02-10 19:54:00,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:00,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:00,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024676243] [2020-02-10 19:54:00,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:00,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:00,375 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:54:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,506 INFO L93 Difference]: Finished difference Result 1226 states and 4319 transitions. [2020-02-10 19:54:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:00,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,509 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:54:00,509 INFO L226 Difference]: Without dead ends: 1213 [2020-02-10 19:54:00,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-02-10 19:54:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 781. [2020-02-10 19:54:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-02-10 19:54:00,531 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-02-10 19:54:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:00,531 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-02-10 19:54:00,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-02-10 19:54:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:00,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:00,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:00,533 INFO L427 AbstractCegarLoop]: === Iteration 1113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1993301313, now seen corresponding path program 1106 times [2020-02-10 19:54:00,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:00,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12932412] [2020-02-10 19:54:00,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:00,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12932412] [2020-02-10 19:54:00,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:00,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:00,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685801739] [2020-02-10 19:54:00,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:00,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:00,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:00,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:00,855 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:54:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,987 INFO L93 Difference]: Finished difference Result 1228 states and 4319 transitions. [2020-02-10 19:54:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:00,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,990 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 19:54:00,990 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 19:54:00,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 19:54:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 777. [2020-02-10 19:54:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 19:54:01,011 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 19:54:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:01,011 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 19:54:01,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 19:54:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:01,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:01,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] [2020-02-10 19:54:01,012 INFO L427 AbstractCegarLoop]: === Iteration 1114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash 888515229, now seen corresponding path program 1107 times [2020-02-10 19:54:01,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:01,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158161620] [2020-02-10 19:54:01,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:01,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158161620] [2020-02-10 19:54:01,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:01,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:01,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222155907] [2020-02-10 19:54:01,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:01,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:01,345 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:54:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:01,501 INFO L93 Difference]: Finished difference Result 1227 states and 4317 transitions. [2020-02-10 19:54:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:01,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:01,504 INFO L225 Difference]: With dead ends: 1227 [2020-02-10 19:54:01,504 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 19:54:01,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 19:54:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-02-10 19:54:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 19:54:01,524 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 19:54:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:01,525 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 19:54:01,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 19:54:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:01,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:01,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:01,526 INFO L427 AbstractCegarLoop]: === Iteration 1115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:01,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1879773051, now seen corresponding path program 1108 times [2020-02-10 19:54:01,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:01,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179984175] [2020-02-10 19:54:01,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:01,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 19:54:01,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179984175] [2020-02-10 19:54:01,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:01,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:01,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183848338] [2020-02-10 19:54:01,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:01,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:01,856 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:54:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,002 INFO L93 Difference]: Finished difference Result 1230 states and 4319 transitions. [2020-02-10 19:54:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:02,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,005 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 19:54:02,005 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:54:02,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:54:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 777. [2020-02-10 19:54:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 19:54:02,027 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 19:54:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:02,027 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 19:54:02,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 19:54:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:02,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:02,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:02,028 INFO L427 AbstractCegarLoop]: === Iteration 1116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1329079903, now seen corresponding path program 1109 times [2020-02-10 19:54:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513046595] [2020-02-10 19:54:02,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:02,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513046595] [2020-02-10 19:54:02,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:02,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:02,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809499789] [2020-02-10 19:54:02,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:02,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:02,358 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:54:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,482 INFO L93 Difference]: Finished difference Result 1233 states and 4327 transitions. [2020-02-10 19:54:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:02,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,486 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:54:02,486 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:54:02,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:54:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-02-10 19:54:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:54:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3108 transitions. [2020-02-10 19:54:02,507 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3108 transitions. Word has length 25 [2020-02-10 19:54:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:02,507 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3108 transitions. [2020-02-10 19:54:02,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3108 transitions. [2020-02-10 19:54:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:02,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:02,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:02,508 INFO L427 AbstractCegarLoop]: === Iteration 1117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1892802013, now seen corresponding path program 1110 times [2020-02-10 19:54:02,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:02,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640686634] [2020-02-10 19:54:02,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:02,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 19:54:02,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640686634] [2020-02-10 19:54:02,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:02,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:02,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946453726] [2020-02-10 19:54:02,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:02,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:02,839 INFO L87 Difference]: Start difference. First operand 783 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:54:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,989 INFO L93 Difference]: Finished difference Result 1234 states and 4323 transitions. [2020-02-10 19:54:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:02,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,993 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 19:54:02,993 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:54:02,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:54:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 773. [2020-02-10 19:54:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 19:54:03,014 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 19:54:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:03,014 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 19:54:03,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 19:54:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:03,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:03,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:03,016 INFO L427 AbstractCegarLoop]: === Iteration 1118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash 63957191, now seen corresponding path program 1111 times [2020-02-10 19:54:03,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:03,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296143615] [2020-02-10 19:54:03,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:03,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 19:54:03,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296143615] [2020-02-10 19:54:03,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:03,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:03,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595591244] [2020-02-10 19:54:03,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:03,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:03,335 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:54:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:03,479 INFO L93 Difference]: Finished difference Result 1213 states and 4281 transitions. [2020-02-10 19:54:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:03,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:03,482 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:54:03,482 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:54:03,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:54:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-02-10 19:54:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:54:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:54:03,503 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:54:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:03,503 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:54:03,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:54:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:03,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:03,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] [2020-02-10 19:54:03,505 INFO L427 AbstractCegarLoop]: === Iteration 1119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1034208805, now seen corresponding path program 1112 times [2020-02-10 19:54:03,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:03,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448431726] [2020-02-10 19:54:03,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:03,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 19:54:03,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448431726] [2020-02-10 19:54:03,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:03,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:03,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258310716] [2020-02-10 19:54:03,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:03,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:03,832 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:54:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:03,961 INFO L93 Difference]: Finished difference Result 1215 states and 4281 transitions. [2020-02-10 19:54:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:03,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:03,965 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:54:03,965 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:03,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 19:54:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 19:54:03,986 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 19:54:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:03,986 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 19:54:03,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 19:54:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:03,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:03,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:03,987 INFO L427 AbstractCegarLoop]: === Iteration 1120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1104192989, now seen corresponding path program 1113 times [2020-02-10 19:54:03,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:03,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252559771] [2020-02-10 19:54:03,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:04,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252559771] [2020-02-10 19:54:04,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:04,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:04,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607271371] [2020-02-10 19:54:04,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:04,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:04,309 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:54:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:04,442 INFO L93 Difference]: Finished difference Result 1207 states and 4265 transitions. [2020-02-10 19:54:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:04,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:04,445 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:54:04,445 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:54:04,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:54:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 19:54:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 19:54:04,466 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 19:54:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:04,466 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 19:54:04,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 19:54:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:04,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:04,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:04,468 INFO L427 AbstractCegarLoop]: === Iteration 1121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2126960123, now seen corresponding path program 1114 times [2020-02-10 19:54:04,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:04,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410670184] [2020-02-10 19:54:04,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:04,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410670184] [2020-02-10 19:54:04,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:04,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:04,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967484220] [2020-02-10 19:54:04,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:04,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:04,812 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:54:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:04,950 INFO L93 Difference]: Finished difference Result 1205 states and 4259 transitions. [2020-02-10 19:54:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:04,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:04,953 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:54:04,953 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:54:04,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:54:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 19:54:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:54:04,976 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:54:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:04,976 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:54:04,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:54:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:04,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:04,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] [2020-02-10 19:54:04,977 INFO L427 AbstractCegarLoop]: === Iteration 1122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:04,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1619748409, now seen corresponding path program 1115 times [2020-02-10 19:54:04,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:04,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353161171] [2020-02-10 19:54:04,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:05,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353161171] [2020-02-10 19:54:05,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:05,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:05,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125717449] [2020-02-10 19:54:05,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:05,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:05,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:05,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:05,290 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:54:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:05,421 INFO L93 Difference]: Finished difference Result 1211 states and 4271 transitions. [2020-02-10 19:54:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:05,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:05,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:05,424 INFO L225 Difference]: With dead ends: 1211 [2020-02-10 19:54:05,424 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:05,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 19:54:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:54:05,445 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:54:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:05,445 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:54:05,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:54:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:05,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:05,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:05,446 INFO L427 AbstractCegarLoop]: === Iteration 1123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2139989085, now seen corresponding path program 1116 times [2020-02-10 19:54:05,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:05,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927274965] [2020-02-10 19:54:05,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:05,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927274965] [2020-02-10 19:54:05,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:05,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:05,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972128294] [2020-02-10 19:54:05,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:05,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:05,762 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:54:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:05,908 INFO L93 Difference]: Finished difference Result 1207 states and 4261 transitions. [2020-02-10 19:54:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:05,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:05,911 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:54:05,912 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:54:05,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:54:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-02-10 19:54:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:54:05,935 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:54:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:05,935 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:54:05,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:54:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:05,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:05,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:05,936 INFO L427 AbstractCegarLoop]: === Iteration 1124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1223913401, now seen corresponding path program 1117 times [2020-02-10 19:54:05,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:05,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952328658] [2020-02-10 19:54:05,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54: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 19:54:06,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952328658] [2020-02-10 19:54:06,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:06,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:06,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266509763] [2020-02-10 19:54:06,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:06,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:06,277 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:54:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:06,450 INFO L93 Difference]: Finished difference Result 1215 states and 4283 transitions. [2020-02-10 19:54:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:06,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:06,454 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:54:06,454 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:06,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 779. [2020-02-10 19:54:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:54:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 19:54:06,475 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 19:54:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:06,475 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 19:54:06,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 19:54:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:06,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:06,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:06,477 INFO L427 AbstractCegarLoop]: === Iteration 1125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:06,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -232655579, now seen corresponding path program 1118 times [2020-02-10 19:54:06,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:06,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472141619] [2020-02-10 19:54:06,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:06,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472141619] [2020-02-10 19:54:06,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:06,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:06,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112008139] [2020-02-10 19:54:06,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:06,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:06,804 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:54:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:06,980 INFO L93 Difference]: Finished difference Result 1218 states and 4285 transitions. [2020-02-10 19:54:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:06,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:06,983 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:54:06,983 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:54:06,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:54:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 775. [2020-02-10 19:54:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:54:07,003 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:54:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:07,003 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:54:07,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:54:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:07,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:07,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:07,005 INFO L427 AbstractCegarLoop]: === Iteration 1126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:07,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash 259221537, now seen corresponding path program 1119 times [2020-02-10 19:54:07,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:07,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349887140] [2020-02-10 19:54:07,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:07,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349887140] [2020-02-10 19:54:07,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:07,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:07,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001555217] [2020-02-10 19:54:07,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:07,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:07,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:07,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:07,326 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:54:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:07,461 INFO L93 Difference]: Finished difference Result 1208 states and 4265 transitions. [2020-02-10 19:54:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:07,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:07,464 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:07,464 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:54:07,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:54:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 19:54:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:54:07,485 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:54:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:07,486 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:54:07,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:54:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:07,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:07,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:07,487 INFO L427 AbstractCegarLoop]: === Iteration 1127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1281988671, now seen corresponding path program 1120 times [2020-02-10 19:54:07,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:07,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837016636] [2020-02-10 19:54:07,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:07,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837016636] [2020-02-10 19:54:07,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:07,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:07,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815642480] [2020-02-10 19:54:07,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:07,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:07,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:07,816 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:54:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:07,981 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-02-10 19:54:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:07,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:07,985 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:54:07,985 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:07,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 19:54:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:54:08,006 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:54:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:08,006 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:54:08,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:54:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:08,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:08,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:08,008 INFO L427 AbstractCegarLoop]: === Iteration 1128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1408354503, now seen corresponding path program 1121 times [2020-02-10 19:54:08,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:08,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442035399] [2020-02-10 19:54:08,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:08,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 19:54:08,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442035399] [2020-02-10 19:54:08,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:08,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:08,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483515208] [2020-02-10 19:54:08,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:08,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:08,331 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:54:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:08,474 INFO L93 Difference]: Finished difference Result 1214 states and 4275 transitions. [2020-02-10 19:54:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:08,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:08,478 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:54:08,478 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:54:08,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:54:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 19:54:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:54:08,499 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:54:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:08,499 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:54:08,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:54:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:08,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:08,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:08,501 INFO L427 AbstractCegarLoop]: === Iteration 1129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1946210081, now seen corresponding path program 1122 times [2020-02-10 19:54:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:08,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123914451] [2020-02-10 19:54:08,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:08,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 19:54:08,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123914451] [2020-02-10 19:54:08,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:08,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:08,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6826135] [2020-02-10 19:54:08,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:08,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:08,828 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:54:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:09,002 INFO L93 Difference]: Finished difference Result 1209 states and 4263 transitions. [2020-02-10 19:54:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:09,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:09,005 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:54:09,005 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:54:09,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:54:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 773. [2020-02-10 19:54:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:54:09,027 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:54:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:09,027 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:54:09,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:54:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:09,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:09,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:09,028 INFO L427 AbstractCegarLoop]: === Iteration 1130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1997374913, now seen corresponding path program 1123 times [2020-02-10 19:54:09,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:09,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932298112] [2020-02-10 19:54:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:09,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 19:54:09,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932298112] [2020-02-10 19:54:09,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:09,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:09,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692856473] [2020-02-10 19:54:09,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:09,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:09,354 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:54:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:09,506 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-02-10 19:54:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:09,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:09,510 INFO L225 Difference]: With dead ends: 1225 [2020-02-10 19:54:09,510 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:54:09,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:54:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-02-10 19:54:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 19:54:09,532 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 19:54:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:09,532 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 19:54:09,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 19:54:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:09,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:09,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:09,533 INFO L427 AbstractCegarLoop]: === Iteration 1131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1224507003, now seen corresponding path program 1124 times [2020-02-10 19:54:09,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:09,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118308251] [2020-02-10 19:54:09,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:09,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118308251] [2020-02-10 19:54:09,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:09,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:09,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204393538] [2020-02-10 19:54:09,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:09,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:09,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:09,885 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:54:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:10,019 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 19:54:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:10,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:10,028 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:54:10,028 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:54:10,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:54:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 775. [2020-02-10 19:54:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:54:10,048 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:54:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:10,048 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:54:10,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:54:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:10,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:10,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] [2020-02-10 19:54:10,049 INFO L427 AbstractCegarLoop]: === Iteration 1132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246117, now seen corresponding path program 1125 times [2020-02-10 19:54:10,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:10,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186724072] [2020-02-10 19:54:10,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:10,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186724072] [2020-02-10 19:54:10,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:10,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:10,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598221736] [2020-02-10 19:54:10,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:10,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:10,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:10,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:10,365 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:54:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:10,534 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 19:54:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:10,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:10,537 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:54:10,537 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 19:54:10,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 19:54:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-02-10 19:54:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:54:10,559 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:54:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:10,559 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:54:10,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:54:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:10,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54: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] [2020-02-10 19:54:10,560 INFO L427 AbstractCegarLoop]: === Iteration 1133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1256016315, now seen corresponding path program 1126 times [2020-02-10 19:54:10,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:10,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639682479] [2020-02-10 19:54:10,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:10,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 19:54:10,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639682479] [2020-02-10 19:54:10,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:10,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:10,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476644942] [2020-02-10 19:54:10,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:10,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:10,878 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:54:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,042 INFO L93 Difference]: Finished difference Result 1212 states and 4271 transitions. [2020-02-10 19:54:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:11,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,046 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:54:11,046 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 19:54:11,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 19:54:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-02-10 19:54:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:54:11,067 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:54:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:11,067 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:54:11,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:54:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:11,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:11,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:11,068 INFO L427 AbstractCegarLoop]: === Iteration 1134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1812252325, now seen corresponding path program 1127 times [2020-02-10 19:54:11,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:11,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349730868] [2020-02-10 19:54:11,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:11,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349730868] [2020-02-10 19:54:11,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:11,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101002729] [2020-02-10 19:54:11,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:11,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:11,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:11,417 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:54:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,553 INFO L93 Difference]: Finished difference Result 1218 states and 4283 transitions. [2020-02-10 19:54:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:11,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,556 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:54:11,556 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:11,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 19:54:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:54:11,577 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:54:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:11,577 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:54:11,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:54:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:11,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:11,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:11,579 INFO L427 AbstractCegarLoop]: === Iteration 1135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1944859393, now seen corresponding path program 1128 times [2020-02-10 19:54:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:11,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169974259] [2020-02-10 19:54:11,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,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 19:54:11,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169974259] [2020-02-10 19:54:11,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:11,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892963670] [2020-02-10 19:54:11,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:11,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:11,904 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:54:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:12,047 INFO L93 Difference]: Finished difference Result 1213 states and 4271 transitions. [2020-02-10 19:54:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:12,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:12,050 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:54:12,051 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:12,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 771. [2020-02-10 19:54:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:54:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 19:54:12,071 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 19:54:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:12,071 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 19:54:12,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 19:54:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:12,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:12,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:12,073 INFO L427 AbstractCegarLoop]: === Iteration 1136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 696773025, now seen corresponding path program 1129 times [2020-02-10 19:54:12,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:12,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273560811] [2020-02-10 19:54:12,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:12,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273560811] [2020-02-10 19:54:12,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:12,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:12,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094137273] [2020-02-10 19:54:12,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:12,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:12,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:12,415 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 19:54:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:12,548 INFO L93 Difference]: Finished difference Result 1220 states and 4303 transitions. [2020-02-10 19:54:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:12,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:12,551 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:12,551 INFO L226 Difference]: Without dead ends: 1207 [2020-02-10 19:54:12,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-02-10 19:54:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 781. [2020-02-10 19:54:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:54:12,571 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:54:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:12,572 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:54:12,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:54:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:12,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:12,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:12,573 INFO L427 AbstractCegarLoop]: === Iteration 1137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1667024639, now seen corresponding path program 1130 times [2020-02-10 19:54:12,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:12,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041129365] [2020-02-10 19:54:12,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:12,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 19:54:12,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041129365] [2020-02-10 19:54:12,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:12,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:12,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162914806] [2020-02-10 19:54:12,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:12,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:12,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:12,926 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:54:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:13,081 INFO L93 Difference]: Finished difference Result 1222 states and 4303 transitions. [2020-02-10 19:54:13,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:13,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:13,085 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:54:13,085 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 19:54:13,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 19:54:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 777. [2020-02-10 19:54:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-02-10 19:54:13,106 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-02-10 19:54:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:13,106 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-02-10 19:54:13,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-02-10 19:54:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:13,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:13,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:13,107 INFO L427 AbstractCegarLoop]: === Iteration 1138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059333, now seen corresponding path program 1131 times [2020-02-10 19:54:13,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:13,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910816545] [2020-02-10 19:54:13,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:13,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910816545] [2020-02-10 19:54:13,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:13,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:13,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679713585] [2020-02-10 19:54:13,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:13,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:13,481 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:54:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:13,634 INFO L93 Difference]: Finished difference Result 1219 states and 4297 transitions. [2020-02-10 19:54:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:13,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:13,637 INFO L225 Difference]: With dead ends: 1219 [2020-02-10 19:54:13,637 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:54:13,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:54:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-02-10 19:54:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-02-10 19:54:13,658 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-02-10 19:54:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:13,658 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-02-10 19:54:13,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-02-10 19:54:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:13,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:13,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:13,660 INFO L427 AbstractCegarLoop]: === Iteration 1139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1113298407, now seen corresponding path program 1132 times [2020-02-10 19:54:13,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:13,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653497754] [2020-02-10 19:54:13,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:14,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653497754] [2020-02-10 19:54:14,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:14,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:14,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042138839] [2020-02-10 19:54:14,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:14,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:14,014 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:54:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:14,153 INFO L93 Difference]: Finished difference Result 1220 states and 4295 transitions. [2020-02-10 19:54:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:14,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:14,156 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:14,157 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:14,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 19:54:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 19:54:14,178 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 19:54:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:14,178 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 19:54:14,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 19:54:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:14,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:14,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:14,180 INFO L427 AbstractCegarLoop]: === Iteration 1140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1638125023, now seen corresponding path program 1133 times [2020-02-10 19:54:14,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:14,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671504752] [2020-02-10 19:54:14,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:14,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671504752] [2020-02-10 19:54:14,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:14,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:14,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897754496] [2020-02-10 19:54:14,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:14,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:14,536 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:54:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:14,670 INFO L93 Difference]: Finished difference Result 1224 states and 4304 transitions. [2020-02-10 19:54:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:14,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:14,673 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 19:54:14,674 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 19:54:14,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 19:54:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-02-10 19:54:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:54:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3104 transitions. [2020-02-10 19:54:14,695 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3104 transitions. Word has length 25 [2020-02-10 19:54:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:14,695 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3104 transitions. [2020-02-10 19:54:14,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3104 transitions. [2020-02-10 19:54:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:14,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:14,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:14,696 INFO L427 AbstractCegarLoop]: === Iteration 1141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:14,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1100269445, now seen corresponding path program 1134 times [2020-02-10 19:54:14,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:14,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424999906] [2020-02-10 19:54:14,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:15,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424999906] [2020-02-10 19:54:15,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:15,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:15,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827612807] [2020-02-10 19:54:15,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:15,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:15,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:15,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:15,074 INFO L87 Difference]: Start difference. First operand 782 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:54:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:15,213 INFO L93 Difference]: Finished difference Result 1223 states and 4297 transitions. [2020-02-10 19:54:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:15,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:15,217 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 19:54:15,217 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:54:15,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:54:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 773. [2020-02-10 19:54:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:54:15,238 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:54:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:15,238 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:54:15,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:54:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:15,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:15,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:15,239 INFO L427 AbstractCegarLoop]: === Iteration 1142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash -148198427, now seen corresponding path program 1135 times [2020-02-10 19:54:15,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:15,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234072577] [2020-02-10 19:54:15,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:15,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234072577] [2020-02-10 19:54:15,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:15,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:15,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786118617] [2020-02-10 19:54:15,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:15,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:15,576 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:54:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:15,709 INFO L93 Difference]: Finished difference Result 1210 states and 4272 transitions. [2020-02-10 19:54:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:15,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:15,712 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:54:15,712 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 19:54:15,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 19:54:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 779. [2020-02-10 19:54:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:54:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 19:54:15,734 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 19:54:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:15,734 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 19:54:15,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 19:54:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:15,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:15,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:15,735 INFO L427 AbstractCegarLoop]: === Iteration 1143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash 822053187, now seen corresponding path program 1136 times [2020-02-10 19:54:15,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:15,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581575942] [2020-02-10 19:54:15,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:16,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581575942] [2020-02-10 19:54:16,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:16,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:16,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181541721] [2020-02-10 19:54:16,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:16,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:16,076 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:54:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:16,201 INFO L93 Difference]: Finished difference Result 1212 states and 4272 transitions. [2020-02-10 19:54:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:16,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:16,204 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:54:16,204 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:16,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 19:54:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:54:16,226 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:54:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:16,226 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:54:16,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:54:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:16,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:16,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:16,227 INFO L427 AbstractCegarLoop]: === Iteration 1144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 892037371, now seen corresponding path program 1137 times [2020-02-10 19:54:16,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:16,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056938132] [2020-02-10 19:54:16,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:16,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056938132] [2020-02-10 19:54:16,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:16,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:16,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919268906] [2020-02-10 19:54:16,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:16,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:16,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:16,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:16,564 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:54:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:16,698 INFO L93 Difference]: Finished difference Result 1204 states and 4256 transitions. [2020-02-10 19:54:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:16,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:16,701 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:54:16,701 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:54:16,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:54:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 19:54:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:54:16,723 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:54:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:16,723 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:54:16,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:54:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:16,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:16,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:16,724 INFO L427 AbstractCegarLoop]: === Iteration 1145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1914804505, now seen corresponding path program 1138 times [2020-02-10 19:54:16,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:16,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199596403] [2020-02-10 19:54:16,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:17,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199596403] [2020-02-10 19:54:17,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:17,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:17,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504789718] [2020-02-10 19:54:17,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:17,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:17,080 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:54:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:17,230 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-02-10 19:54:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:17,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:17,234 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:54:17,234 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:54:17,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:54:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-02-10 19:54:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:54:17,255 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:54:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:17,255 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:54:17,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:54:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:17,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:17,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] [2020-02-10 19:54:17,257 INFO L427 AbstractCegarLoop]: === Iteration 1146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1831904027, now seen corresponding path program 1139 times [2020-02-10 19:54:17,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:17,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541185753] [2020-02-10 19:54:17,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:17,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541185753] [2020-02-10 19:54:17,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:17,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:17,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903011806] [2020-02-10 19:54:17,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:17,585 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:54:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:17,719 INFO L93 Difference]: Finished difference Result 1208 states and 4262 transitions. [2020-02-10 19:54:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:17,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:17,723 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:17,723 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:17,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 19:54:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:54:17,745 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:54:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:17,745 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:54:17,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:54:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:17,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:17,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:17,746 INFO L427 AbstractCegarLoop]: === Iteration 1147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1927833467, now seen corresponding path program 1140 times [2020-02-10 19:54:17,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:17,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426964025] [2020-02-10 19:54:17,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:18,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426964025] [2020-02-10 19:54:18,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:18,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905179651] [2020-02-10 19:54:18,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:18,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:18,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:18,080 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:54:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:18,215 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 19:54:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:18,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:18,219 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:54:18,219 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:54:18,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:54:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-02-10 19:54:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:54:18,240 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:54:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:18,240 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:54:18,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:54:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:18,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:18,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:18,241 INFO L427 AbstractCegarLoop]: === Iteration 1148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 67479333, now seen corresponding path program 1141 times [2020-02-10 19:54:18,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:18,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444087371] [2020-02-10 19:54:18,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54: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 19:54:18,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444087371] [2020-02-10 19:54:18,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:18,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974724767] [2020-02-10 19:54:18,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:18,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:18,584 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:54:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:18,716 INFO L93 Difference]: Finished difference Result 1208 states and 4266 transitions. [2020-02-10 19:54:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:18,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:18,719 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:18,719 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:54:18,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:54:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-02-10 19:54:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:54:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:54:18,740 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:54:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:18,740 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:54:18,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:54:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:18,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:18,741 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:18,742 INFO L427 AbstractCegarLoop]: === Iteration 1149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1069240259, now seen corresponding path program 1142 times [2020-02-10 19:54:18,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:18,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581046728] [2020-02-10 19:54:18,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:19,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581046728] [2020-02-10 19:54:19,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:19,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:19,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893435339] [2020-02-10 19:54:19,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:19,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:19,112 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:54:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:19,242 INFO L93 Difference]: Finished difference Result 1209 states and 4264 transitions. [2020-02-10 19:54:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:19,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:19,245 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:54:19,245 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:54:19,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:54:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-02-10 19:54:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:54:19,267 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:54:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:19,267 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:54:19,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:54:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:19,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:19,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:19,268 INFO L427 AbstractCegarLoop]: === Iteration 1150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -375419807, now seen corresponding path program 1143 times [2020-02-10 19:54:19,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:19,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338364168] [2020-02-10 19:54:19,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:19,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 19:54:19,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338364168] [2020-02-10 19:54:19,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:19,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:19,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522064743] [2020-02-10 19:54:19,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:19,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:19,612 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:54:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:19,735 INFO L93 Difference]: Finished difference Result 1203 states and 4252 transitions. [2020-02-10 19:54:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:19,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:19,738 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:54:19,738 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:54:19,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:54:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:54:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:54:19,760 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:54:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:19,760 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:54:19,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:54:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:19,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:19,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:19,761 INFO L427 AbstractCegarLoop]: === Iteration 1151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash 647347327, now seen corresponding path program 1144 times [2020-02-10 19:54:19,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:19,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687179132] [2020-02-10 19:54:19,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:20,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687179132] [2020-02-10 19:54:20,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:20,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:20,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118898324] [2020-02-10 19:54:20,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:20,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:20,102 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:54:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:20,231 INFO L93 Difference]: Finished difference Result 1201 states and 4246 transitions. [2020-02-10 19:54:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:20,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:20,234 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:54:20,234 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:54:20,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:54:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-02-10 19:54:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:54:20,256 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:54:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:20,256 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:54:20,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:54:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:20,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:20,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] [2020-02-10 19:54:20,257 INFO L427 AbstractCegarLoop]: === Iteration 1152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1584716955, now seen corresponding path program 1145 times [2020-02-10 19:54:20,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:20,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391685751] [2020-02-10 19:54:20,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:20,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 19:54:20,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391685751] [2020-02-10 19:54:20,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:20,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:20,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344106213] [2020-02-10 19:54:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:20,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:20,588 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:54:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:20,726 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-02-10 19:54:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:20,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:20,730 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:54:20,730 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:54:20,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:54:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 19:54:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:54:20,770 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:54:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:20,771 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:54:20,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:54:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:20,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:20,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:20,772 INFO L427 AbstractCegarLoop]: === Iteration 1153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1637164961, now seen corresponding path program 1146 times [2020-02-10 19:54:20,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:20,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381925539] [2020-02-10 19:54:20,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54: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 19:54:21,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381925539] [2020-02-10 19:54:21,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024596504] [2020-02-10 19:54:21,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:21,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:21,113 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:54:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:21,243 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-02-10 19:54:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:21,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:21,247 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:54:21,247 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 19:54:21,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 19:54:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 773. [2020-02-10 19:54:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:54:21,268 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:54:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:21,268 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:54:21,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:54:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:21,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:21,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] [2020-02-10 19:54:21,269 INFO L427 AbstractCegarLoop]: === Iteration 1154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1988547263, now seen corresponding path program 1147 times [2020-02-10 19:54:21,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:21,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684500142] [2020-02-10 19:54:21,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:21,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684500142] [2020-02-10 19:54:21,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:21,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:21,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823456290] [2020-02-10 19:54:21,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:21,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:21,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:21,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:21,608 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:54:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:21,749 INFO L93 Difference]: Finished difference Result 1216 states and 4282 transitions. [2020-02-10 19:54:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:21,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:21,752 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:54:21,752 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 19:54:21,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 19:54:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 780. [2020-02-10 19:54:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-02-10 19:54:21,773 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-02-10 19:54:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:21,773 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-02-10 19:54:21,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-02-10 19:54:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:21,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:21,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:21,774 INFO L427 AbstractCegarLoop]: === Iteration 1155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1768564455, now seen corresponding path program 1148 times [2020-02-10 19:54:21,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:21,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214389417] [2020-02-10 19:54:21,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:22,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214389417] [2020-02-10 19:54:22,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:22,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345885637] [2020-02-10 19:54:22,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:22,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:22,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:22,119 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:54:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:22,261 INFO L93 Difference]: Finished difference Result 1215 states and 4275 transitions. [2020-02-10 19:54:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:22,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:22,265 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:54:22,265 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:22,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 19:54:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:54:22,286 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:54:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:22,286 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:54:22,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:54:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:22,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:22,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:22,288 INFO L427 AbstractCegarLoop]: === Iteration 1156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1212328445, now seen corresponding path program 1149 times [2020-02-10 19:54:22,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:22,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330410490] [2020-02-10 19:54:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:22,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330410490] [2020-02-10 19:54:22,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:22,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556264097] [2020-02-10 19:54:22,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:22,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:22,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:22,613 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:54:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:22,740 INFO L93 Difference]: Finished difference Result 1210 states and 4265 transitions. [2020-02-10 19:54:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:22,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:22,743 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:54:22,744 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:54:22,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:54:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 19:54:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:54:22,785 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:54:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:22,785 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:54:22,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:54:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:22,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:22,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:22,786 INFO L427 AbstractCegarLoop]: === Iteration 1157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1747558247, now seen corresponding path program 1150 times [2020-02-10 19:54:22,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:22,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772897595] [2020-02-10 19:54:22,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:23,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772897595] [2020-02-10 19:54:23,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:23,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:23,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395210251] [2020-02-10 19:54:23,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:23,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:23,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:23,116 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:54:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,267 INFO L93 Difference]: Finished difference Result 1206 states and 4255 transitions. [2020-02-10 19:54:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:23,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,270 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:54:23,270 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:23,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 19:54:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:54:23,294 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:54:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:23,294 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:54:23,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:54:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:23,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:23,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:23,295 INFO L427 AbstractCegarLoop]: === Iteration 1158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1180819133, now seen corresponding path program 1151 times [2020-02-10 19:54:23,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:23,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204771434] [2020-02-10 19:54:23,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:23,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204771434] [2020-02-10 19:54:23,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:23,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:23,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824356552] [2020-02-10 19:54:23,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:23,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:23,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:23,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:23,628 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:54:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,762 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-02-10 19:54:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:23,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,766 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:23,766 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:54:23,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:54:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 19:54:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:54:23,788 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:54:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:23,788 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:54:23,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:54:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:23,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:23,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:23,789 INFO L427 AbstractCegarLoop]: === Iteration 1159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2041062783, now seen corresponding path program 1152 times [2020-02-10 19:54:23,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:23,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137118758] [2020-02-10 19:54:23,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:24,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 19:54:24,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137118758] [2020-02-10 19:54:24,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:24,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:24,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795196468] [2020-02-10 19:54:24,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:24,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:24,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:24,152 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:54:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:24,276 INFO L93 Difference]: Finished difference Result 1205 states and 4251 transitions. [2020-02-10 19:54:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:24,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:24,280 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:54:24,280 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:54:24,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:54:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 771. [2020-02-10 19:54:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:54:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 19:54:24,301 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 19:54:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:24,301 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 19:54:24,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 19:54:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:24,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:24,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:24,302 INFO L427 AbstractCegarLoop]: === Iteration 1160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1015408803, now seen corresponding path program 1153 times [2020-02-10 19:54:24,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:24,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677445420] [2020-02-10 19:54:24,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:24,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677445420] [2020-02-10 19:54:24,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:24,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:24,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161096211] [2020-02-10 19:54:24,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:24,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:24,629 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 19:54:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:24,762 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-02-10 19:54:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:24,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:24,765 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 19:54:24,766 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:54:24,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:54:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-02-10 19:54:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 19:54:24,787 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 19:54:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:24,787 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 19:54:24,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 19:54:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:24,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:24,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:24,788 INFO L427 AbstractCegarLoop]: === Iteration 1161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash -24150981, now seen corresponding path program 1154 times [2020-02-10 19:54:24,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:24,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265119073] [2020-02-10 19:54:24,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:25,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265119073] [2020-02-10 19:54:25,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:25,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:25,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740822853] [2020-02-10 19:54:25,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:25,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:25,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:25,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:25,135 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:54:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:25,265 INFO L93 Difference]: Finished difference Result 1226 states and 4309 transitions. [2020-02-10 19:54:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:25,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:25,268 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:54:25,268 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:54:25,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:54:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-02-10 19:54:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 19:54:25,289 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 19:54:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:25,289 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 19:54:25,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 19:54:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:25,290 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:25,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:25,290 INFO L427 AbstractCegarLoop]: === Iteration 1162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash 910625275, now seen corresponding path program 1155 times [2020-02-10 19:54:25,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:25,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14405118] [2020-02-10 19:54:25,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:25,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 19:54:25,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14405118] [2020-02-10 19:54:25,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:25,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:25,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664424354] [2020-02-10 19:54:25,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:25,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:25,626 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:54:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:25,750 INFO L93 Difference]: Finished difference Result 1221 states and 4299 transitions. [2020-02-10 19:54:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:25,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:25,752 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 19:54:25,752 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:54:25,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:54:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 781. [2020-02-10 19:54:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 19:54:25,774 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 19:54:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:25,774 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 19:54:25,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 19:54:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:25,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:25,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:25,775 INFO L427 AbstractCegarLoop]: === Iteration 1163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1912386201, now seen corresponding path program 1156 times [2020-02-10 19:54:25,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:25,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772975080] [2020-02-10 19:54:25,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:26,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772975080] [2020-02-10 19:54:26,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:26,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:26,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839308017] [2020-02-10 19:54:26,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:26,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:26,113 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:54:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:26,244 INFO L93 Difference]: Finished difference Result 1222 states and 4297 transitions. [2020-02-10 19:54:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:26,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:26,248 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:54:26,248 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:54:26,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:54:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 19:54:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3093 transitions. [2020-02-10 19:54:26,269 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3093 transitions. Word has length 25 [2020-02-10 19:54:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:26,270 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3093 transitions. [2020-02-10 19:54:26,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3093 transitions. [2020-02-10 19:54:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:26,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:26,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:26,271 INFO L427 AbstractCegarLoop]: === Iteration 1164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 965666653, now seen corresponding path program 1157 times [2020-02-10 19:54:26,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:26,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129605490] [2020-02-10 19:54:26,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:26,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129605490] [2020-02-10 19:54:26,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:26,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:26,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059638959] [2020-02-10 19:54:26,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:26,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:26,607 INFO L87 Difference]: Start difference. First operand 777 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:54:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:26,737 INFO L93 Difference]: Finished difference Result 1228 states and 4310 transitions. [2020-02-10 19:54:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:26,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:26,741 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 19:54:26,741 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 19:54:26,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 19:54:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-02-10 19:54:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:54:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3102 transitions. [2020-02-10 19:54:26,763 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3102 transitions. Word has length 25 [2020-02-10 19:54:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:26,763 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3102 transitions. [2020-02-10 19:54:26,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3102 transitions. [2020-02-10 19:54:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:26,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:26,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:26,764 INFO L427 AbstractCegarLoop]: === Iteration 1165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1718359685, now seen corresponding path program 1158 times [2020-02-10 19:54:26,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:26,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746556107] [2020-02-10 19:54:26,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:27,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746556107] [2020-02-10 19:54:27,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:27,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:27,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500791245] [2020-02-10 19:54:27,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:27,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:27,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:27,111 INFO L87 Difference]: Start difference. First operand 782 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:54:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:27,233 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 19:54:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:27,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:27,236 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:54:27,236 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 19:54:27,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 19:54:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 773. [2020-02-10 19:54:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:54:27,257 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:54:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:27,257 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:54:27,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:54:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:27,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:27,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:27,258 INFO L427 AbstractCegarLoop]: === Iteration 1166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1860380255, now seen corresponding path program 1159 times [2020-02-10 19:54:27,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:27,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975665225] [2020-02-10 19:54:27,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54: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 19:54:27,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975665225] [2020-02-10 19:54:27,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:27,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:27,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775187717] [2020-02-10 19:54:27,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:27,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:27,585 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:54:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:27,708 INFO L93 Difference]: Finished difference Result 1213 states and 4276 transitions. [2020-02-10 19:54:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:27,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:27,711 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:54:27,711 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:54:27,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:54:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-02-10 19:54:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:54:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:54:27,733 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:54:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:27,733 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:54:27,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:54:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:27,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:27,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:27,734 INFO L427 AbstractCegarLoop]: === Iteration 1167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash -869122433, now seen corresponding path program 1160 times [2020-02-10 19:54:27,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:27,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306231741] [2020-02-10 19:54:27,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:28,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 19:54:28,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306231741] [2020-02-10 19:54:28,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:28,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:28,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774671354] [2020-02-10 19:54:28,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:28,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:28,056 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:54:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:28,186 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-02-10 19:54:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:28,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:28,189 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:54:28,189 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:28,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 19:54:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:54:28,210 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:54:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:28,210 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:54:28,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:54:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:28,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:28,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] [2020-02-10 19:54:28,211 INFO L427 AbstractCegarLoop]: === Iteration 1168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash -377245317, now seen corresponding path program 1161 times [2020-02-10 19:54:28,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:28,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463115874] [2020-02-10 19:54:28,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:28,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463115874] [2020-02-10 19:54:28,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:28,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:28,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327803844] [2020-02-10 19:54:28,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:28,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:28,532 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:54:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:28,673 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-02-10 19:54:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:28,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:28,676 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:54:28,676 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:28,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 19:54:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:54:28,697 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:54:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:28,697 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:54:28,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:54:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:28,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:28,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:28,698 INFO L427 AbstractCegarLoop]: === Iteration 1169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash 645521817, now seen corresponding path program 1162 times [2020-02-10 19:54:28,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:28,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323648183] [2020-02-10 19:54:28,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:29,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323648183] [2020-02-10 19:54:29,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:29,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:29,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446187216] [2020-02-10 19:54:29,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:29,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:29,039 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:54:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:29,186 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 19:54:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:29,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:29,189 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:54:29,190 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:54:29,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:54:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-02-10 19:54:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:54:29,211 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:54:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:29,211 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:54:29,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:54:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:29,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:29,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:29,213 INFO L427 AbstractCegarLoop]: === Iteration 1170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 771887649, now seen corresponding path program 1163 times [2020-02-10 19:54:29,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:29,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871433175] [2020-02-10 19:54:29,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:29,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 19:54:29,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871433175] [2020-02-10 19:54:29,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:29,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:29,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084406718] [2020-02-10 19:54:29,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:29,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:29,527 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:54:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:29,688 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 19:54:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:29,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:29,691 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:54:29,691 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:29,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 19:54:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:54:29,712 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:54:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:29,712 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:54:29,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:54:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:29,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:29,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:29,713 INFO L427 AbstractCegarLoop]: === Iteration 1171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1309743227, now seen corresponding path program 1164 times [2020-02-10 19:54:29,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:29,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440719555] [2020-02-10 19:54:29,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:30,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440719555] [2020-02-10 19:54:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:30,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159936323] [2020-02-10 19:54:30,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:30,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:30,034 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:54:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:30,176 INFO L93 Difference]: Finished difference Result 1207 states and 4256 transitions. [2020-02-10 19:54:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:30,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:30,179 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:54:30,179 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:54:30,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:54:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-02-10 19:54:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:54:30,201 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:54:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:30,201 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:54:30,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:54:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:30,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:30,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:30,202 INFO L427 AbstractCegarLoop]: === Iteration 1172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:30,202 INFO L82 PathProgramCache]: Analyzing trace with hash -356831903, now seen corresponding path program 1165 times [2020-02-10 19:54:30,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:30,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277117589] [2020-02-10 19:54:30,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:30,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277117589] [2020-02-10 19:54:30,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:30,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474767073] [2020-02-10 19:54:30,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:30,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:30,532 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:54:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:30,668 INFO L93 Difference]: Finished difference Result 1209 states and 4266 transitions. [2020-02-10 19:54:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:30,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:30,671 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:54:30,672 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:30,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-02-10 19:54:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:54:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:54:30,693 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:54:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:30,693 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:54:30,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:54:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:30,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:30,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:30,694 INFO L427 AbstractCegarLoop]: === Iteration 1173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash 644929023, now seen corresponding path program 1166 times [2020-02-10 19:54:30,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:30,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932139900] [2020-02-10 19:54:30,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:31,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932139900] [2020-02-10 19:54:31,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:31,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:31,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189180703] [2020-02-10 19:54:31,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:31,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:31,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:31,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:31,024 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:54:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:31,164 INFO L93 Difference]: Finished difference Result 1210 states and 4264 transitions. [2020-02-10 19:54:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:31,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:31,168 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:54:31,168 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:54:31,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:54:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 19:54:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:54:31,206 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:54:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:31,206 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:54:31,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:54:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:31,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:31,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:31,208 INFO L427 AbstractCegarLoop]: === Iteration 1174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash -799731043, now seen corresponding path program 1167 times [2020-02-10 19:54:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314876420] [2020-02-10 19:54:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:31,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314876420] [2020-02-10 19:54:31,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:31,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:31,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116886321] [2020-02-10 19:54:31,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:31,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:31,540 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:54:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:31,667 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 19:54:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:31,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:31,671 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:54:31,671 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:54:31,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:54:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 19:54:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:54:31,693 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:54:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:31,693 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:54:31,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:54:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:31,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:31,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:31,695 INFO L427 AbstractCegarLoop]: === Iteration 1175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 223036091, now seen corresponding path program 1168 times [2020-02-10 19:54:31,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:31,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969618050] [2020-02-10 19:54:31,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:32,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969618050] [2020-02-10 19:54:32,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:32,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:32,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990998802] [2020-02-10 19:54:32,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:32,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:32,032 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:54:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:32,190 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-02-10 19:54:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:32,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:32,193 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:54:32,193 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:54:32,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:54:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-02-10 19:54:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:54:32,215 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:54:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:32,215 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:54:32,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:54:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:32,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:32,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] [2020-02-10 19:54:32,216 INFO L427 AbstractCegarLoop]: === Iteration 1176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2009028191, now seen corresponding path program 1169 times [2020-02-10 19:54:32,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:32,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514472396] [2020-02-10 19:54:32,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:32,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514472396] [2020-02-10 19:54:32,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:32,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:32,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536293047] [2020-02-10 19:54:32,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:32,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:32,539 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:54:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:32,670 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-02-10 19:54:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:32,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:32,674 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:54:32,674 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:54:32,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:54:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-02-10 19:54:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:54:32,695 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:54:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:32,696 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:54:32,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:54:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:32,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:32,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:32,697 INFO L427 AbstractCegarLoop]: === Iteration 1177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1212853725, now seen corresponding path program 1170 times [2020-02-10 19:54:32,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:32,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803071241] [2020-02-10 19:54:32,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:33,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803071241] [2020-02-10 19:54:33,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:33,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:33,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52253041] [2020-02-10 19:54:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:33,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:33,024 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:54:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:33,182 INFO L93 Difference]: Finished difference Result 1203 states and 4246 transitions. [2020-02-10 19:54:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:33,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:33,185 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:54:33,185 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:54:33,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:54:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 773. [2020-02-10 19:54:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:54:33,207 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:54:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:33,207 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:54:33,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:54:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:33,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:33,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:33,208 INFO L427 AbstractCegarLoop]: === Iteration 1178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash 297371643, now seen corresponding path program 1171 times [2020-02-10 19:54:33,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:33,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157424646] [2020-02-10 19:54:33,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:33,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157424646] [2020-02-10 19:54:33,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:33,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:33,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042951169] [2020-02-10 19:54:33,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:33,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:33,539 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:54:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:33,687 INFO L93 Difference]: Finished difference Result 1220 states and 4288 transitions. [2020-02-10 19:54:33,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:33,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:33,690 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:33,690 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:54:33,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:54:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-02-10 19:54:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 19:54:33,711 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 19:54:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:33,711 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 19:54:33,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 19:54:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:33,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:33,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] [2020-02-10 19:54:33,712 INFO L427 AbstractCegarLoop]: === Iteration 1179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1908312601, now seen corresponding path program 1172 times [2020-02-10 19:54:33,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:33,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116981416] [2020-02-10 19:54:33,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:34,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116981416] [2020-02-10 19:54:34,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:34,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:34,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028519887] [2020-02-10 19:54:34,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:34,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:34,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:34,030 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:54:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:34,181 INFO L93 Difference]: Finished difference Result 1218 states and 4279 transitions. [2020-02-10 19:54:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:34,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:34,185 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:54:34,185 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 19:54:34,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 19:54:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-02-10 19:54:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:54:34,207 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:54:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:34,207 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:54:34,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:54:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:34,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:34,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:34,209 INFO L427 AbstractCegarLoop]: === Iteration 1180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:34,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1391463231, now seen corresponding path program 1173 times [2020-02-10 19:54:34,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:34,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541689859] [2020-02-10 19:54:34,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:34,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541689859] [2020-02-10 19:54:34,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:34,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:34,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916641529] [2020-02-10 19:54:34,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:34,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:34,514 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:54:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:34,642 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-02-10 19:54:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:34,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:34,645 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:54:34,645 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:54:34,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:54:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 19:54:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:54:34,667 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:54:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:34,667 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:54:34,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:54:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:34,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:34,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:34,668 INFO L427 AbstractCegarLoop]: === Iteration 1181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1929318809, now seen corresponding path program 1174 times [2020-02-10 19:54:34,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:34,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594549793] [2020-02-10 19:54:34,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:34,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594549793] [2020-02-10 19:54:34,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:34,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:34,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976184468] [2020-02-10 19:54:34,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:34,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:34,970 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:54:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:35,121 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-02-10 19:54:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:35,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:35,124 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:54:35,124 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:35,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 19:54:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:54:35,146 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:54:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:35,146 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:54:35,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:54:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:35,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:35,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:35,147 INFO L427 AbstractCegarLoop]: === Iteration 1182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:35,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1401966335, now seen corresponding path program 1175 times [2020-02-10 19:54:35,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:35,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404783978] [2020-02-10 19:54:35,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:35,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 19:54:35,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404783978] [2020-02-10 19:54:35,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:35,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:35,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877448410] [2020-02-10 19:54:35,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:35,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:35,465 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:54:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:35,593 INFO L93 Difference]: Finished difference Result 1210 states and 4261 transitions. [2020-02-10 19:54:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:35,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:35,597 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:54:35,597 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:35,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 19:54:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:54:35,618 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:54:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:35,619 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:54:35,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:54:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:35,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:35,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:35,620 INFO L427 AbstractCegarLoop]: === Iteration 1183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash 328880955, now seen corresponding path program 1176 times [2020-02-10 19:54:35,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:35,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182985812] [2020-02-10 19:54:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:35,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182985812] [2020-02-10 19:54:35,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:35,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:35,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144317669] [2020-02-10 19:54:35,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:35,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:35,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:35,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:35,952 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:54:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:36,126 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-02-10 19:54:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:36,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:36,129 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:54:36,129 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:54:36,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:54:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 771. [2020-02-10 19:54:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:54:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 19:54:36,150 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 19:54:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:36,151 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 19:54:36,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 19:54:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:36,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:36,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:36,152 INFO L427 AbstractCegarLoop]: === Iteration 1184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 472498085, now seen corresponding path program 1177 times [2020-02-10 19:54:36,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:36,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604508667] [2020-02-10 19:54:36,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:36,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 19:54:36,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604508667] [2020-02-10 19:54:36,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:36,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:36,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304081007] [2020-02-10 19:54:36,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:36,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:36,499 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 19:54:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:36,622 INFO L93 Difference]: Finished difference Result 1241 states and 4353 transitions. [2020-02-10 19:54:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:36,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:36,626 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 19:54:36,626 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:54:36,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:54:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 784. [2020-02-10 19:54:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:54:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-02-10 19:54:36,648 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-02-10 19:54:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:36,648 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-02-10 19:54:36,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-02-10 19:54:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:36,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:36,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:36,649 INFO L427 AbstractCegarLoop]: === Iteration 1185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:36,649 INFO L82 PathProgramCache]: Analyzing trace with hash -600587295, now seen corresponding path program 1178 times [2020-02-10 19:54:36,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:36,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649904812] [2020-02-10 19:54:36,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:36,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649904812] [2020-02-10 19:54:36,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:36,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:36,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30269025] [2020-02-10 19:54:36,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:36,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:36,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:36,999 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-02-10 19:54:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:37,138 INFO L93 Difference]: Finished difference Result 1242 states and 4349 transitions. [2020-02-10 19:54:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:37,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:37,142 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 19:54:37,142 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:54:37,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:54:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 19:54:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:54:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 19:54:37,163 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 19:54:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:37,164 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 19:54:37,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 19:54:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:37,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:37,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:37,165 INFO L427 AbstractCegarLoop]: === Iteration 1186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1127939769, now seen corresponding path program 1179 times [2020-02-10 19:54:37,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:37,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56972288] [2020-02-10 19:54:37,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:37,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56972288] [2020-02-10 19:54:37,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:37,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:37,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461078573] [2020-02-10 19:54:37,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:37,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:37,509 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:54:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:37,638 INFO L93 Difference]: Finished difference Result 1238 states and 4341 transitions. [2020-02-10 19:54:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:37,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:37,641 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:54:37,642 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:54:37,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:54:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 783. [2020-02-10 19:54:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:54:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3107 transitions. [2020-02-10 19:54:37,663 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3107 transitions. Word has length 25 [2020-02-10 19:54:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:37,663 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3107 transitions. [2020-02-10 19:54:37,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3107 transitions. [2020-02-10 19:54:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:37,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:37,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:37,664 INFO L427 AbstractCegarLoop]: === Iteration 1187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:37,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -590084191, now seen corresponding path program 1180 times [2020-02-10 19:54:37,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:37,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394795905] [2020-02-10 19:54:37,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:38,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394795905] [2020-02-10 19:54:38,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:38,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:38,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750233844] [2020-02-10 19:54:38,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:38,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:38,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:38,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:38,025 INFO L87 Difference]: Start difference. First operand 783 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:54:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:38,152 INFO L93 Difference]: Finished difference Result 1237 states and 4334 transitions. [2020-02-10 19:54:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:38,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:38,156 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:54:38,156 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:54:38,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:54:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 19:54:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:54:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-02-10 19:54:38,177 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-02-10 19:54:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:38,177 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-02-10 19:54:38,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-02-10 19:54:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:38,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:38,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:38,178 INFO L427 AbstractCegarLoop]: === Iteration 1188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:38,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1106933561, now seen corresponding path program 1181 times [2020-02-10 19:54:38,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:38,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529416863] [2020-02-10 19:54:38,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:38,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529416863] [2020-02-10 19:54:38,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:38,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:38,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066496752] [2020-02-10 19:54:38,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:38,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:38,516 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:54:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:38,663 INFO L93 Difference]: Finished difference Result 1240 states and 4340 transitions. [2020-02-10 19:54:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:38,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:38,667 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:54:38,667 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:54:38,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:54:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 783. [2020-02-10 19:54:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:54:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-02-10 19:54:38,689 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-02-10 19:54:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:38,689 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-02-10 19:54:38,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-02-10 19:54:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:38,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:38,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:38,690 INFO L427 AbstractCegarLoop]: === Iteration 1189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:38,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash 504007397, now seen corresponding path program 1182 times [2020-02-10 19:54:38,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:38,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519977348] [2020-02-10 19:54:38,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:39,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519977348] [2020-02-10 19:54:39,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:39,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:39,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203955277] [2020-02-10 19:54:39,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:39,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:39,037 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:54:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:39,186 INFO L93 Difference]: Finished difference Result 1238 states and 4331 transitions. [2020-02-10 19:54:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:39,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:39,190 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:54:39,190 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 19:54:39,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 19:54:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 773. [2020-02-10 19:54:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:54:39,211 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:54:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:39,211 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:54:39,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:54:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:39,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:39,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:39,213 INFO L427 AbstractCegarLoop]: === Iteration 1190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash 29598945, now seen corresponding path program 1183 times [2020-02-10 19:54:39,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:39,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304292803] [2020-02-10 19:54:39,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:39,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304292803] [2020-02-10 19:54:39,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:39,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:39,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224978153] [2020-02-10 19:54:39,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:39,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:39,540 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:54:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:39,671 INFO L93 Difference]: Finished difference Result 1229 states and 4315 transitions. [2020-02-10 19:54:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:39,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:39,674 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 19:54:39,674 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 19:54:39,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 19:54:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-02-10 19:54:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-02-10 19:54:39,696 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-02-10 19:54:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:39,696 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-02-10 19:54:39,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-02-10 19:54:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:39,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:39,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:39,697 INFO L427 AbstractCegarLoop]: === Iteration 1191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1043486435, now seen corresponding path program 1184 times [2020-02-10 19:54:39,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:39,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121241779] [2020-02-10 19:54:39,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:40,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121241779] [2020-02-10 19:54:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:40,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349696815] [2020-02-10 19:54:40,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:40,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:40,035 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:54:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,177 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-02-10 19:54:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:40,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,180 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 19:54:40,180 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:54:40,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:54:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 775. [2020-02-10 19:54:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:54:40,201 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:54:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:40,201 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:54:40,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:54:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:40,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:40,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:40,202 INFO L427 AbstractCegarLoop]: === Iteration 1192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash -476747321, now seen corresponding path program 1185 times [2020-02-10 19:54:40,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:40,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620498807] [2020-02-10 19:54:40,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:40,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620498807] [2020-02-10 19:54:40,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:40,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:40,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795714591] [2020-02-10 19:54:40,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:40,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:40,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:40,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:40,541 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:54:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,680 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-02-10 19:54:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:40,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,683 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:40,683 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 19:54:40,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 19:54:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-02-10 19:54:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:54:40,704 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:54:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:40,704 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:54:40,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:54:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:40,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:40,705 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:40,706 INFO L427 AbstractCegarLoop]: === Iteration 1193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1011977123, now seen corresponding path program 1186 times [2020-02-10 19:54:40,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:40,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377230300] [2020-02-10 19:54:40,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:41,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 19:54:41,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377230300] [2020-02-10 19:54:41,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:41,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:41,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563517710] [2020-02-10 19:54:41,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:41,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:41,022 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:54:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:41,149 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 19:54:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:41,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:41,153 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:54:41,153 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 19:54:41,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 19:54:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-02-10 19:54:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:54:41,174 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:54:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:41,174 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:54:41,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:54:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:41,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:41,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] [2020-02-10 19:54:41,176 INFO L427 AbstractCegarLoop]: === Iteration 1194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash -455741113, now seen corresponding path program 1187 times [2020-02-10 19:54:41,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:41,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073287486] [2020-02-10 19:54:41,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:41,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073287486] [2020-02-10 19:54:41,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:41,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:41,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882160231] [2020-02-10 19:54:41,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:41,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:41,510 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:54:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:41,648 INFO L93 Difference]: Finished difference Result 1222 states and 4293 transitions. [2020-02-10 19:54:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:41,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:41,652 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:54:41,652 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:54:41,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:54:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-02-10 19:54:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:54:41,673 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:54:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:41,674 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:54:41,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:54:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:41,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:41,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:41,675 INFO L427 AbstractCegarLoop]: === Iteration 1195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash 82114465, now seen corresponding path program 1188 times [2020-02-10 19:54:41,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:41,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653809142] [2020-02-10 19:54:41,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:42,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653809142] [2020-02-10 19:54:42,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:42,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:42,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263976081] [2020-02-10 19:54:42,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:42,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:42,011 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:54:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:42,153 INFO L93 Difference]: Finished difference Result 1217 states and 4281 transitions. [2020-02-10 19:54:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:42,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:42,156 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 19:54:42,156 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:42,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 773. [2020-02-10 19:54:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:54:42,178 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:54:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:42,178 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:54:42,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:54:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:42,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:42,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:42,179 INFO L427 AbstractCegarLoop]: === Iteration 1196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:42,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash 355195169, now seen corresponding path program 1189 times [2020-02-10 19:54:42,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:42,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426701970] [2020-02-10 19:54:42,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:42,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426701970] [2020-02-10 19:54:42,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:42,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:42,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310333922] [2020-02-10 19:54:42,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:42,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:42,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:42,515 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:54:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:42,680 INFO L93 Difference]: Finished difference Result 1223 states and 4299 transitions. [2020-02-10 19:54:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:42,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:42,684 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 19:54:42,684 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:54:42,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:54:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-02-10 19:54:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 19:54:42,705 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 19:54:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:42,705 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 19:54:42,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 19:54:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:42,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:42,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:42,706 INFO L427 AbstractCegarLoop]: === Iteration 1197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash 893050747, now seen corresponding path program 1190 times [2020-02-10 19:54:42,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:42,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367959004] [2020-02-10 19:54:42,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:43,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367959004] [2020-02-10 19:54:43,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:43,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738008483] [2020-02-10 19:54:43,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:43,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:43,044 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:54:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:43,171 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-02-10 19:54:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:43,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:43,175 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:54:43,175 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 19:54:43,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:43,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 19:54:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-02-10 19:54:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:54:43,197 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:54:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:43,197 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:54:43,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:54:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:43,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:43,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:43,198 INFO L427 AbstractCegarLoop]: === Iteration 1198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1449286757, now seen corresponding path program 1191 times [2020-02-10 19:54:43,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:43,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823953151] [2020-02-10 19:54:43,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:43,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823953151] [2020-02-10 19:54:43,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:43,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014193334] [2020-02-10 19:54:43,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:43,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:43,521 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:54:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:43,645 INFO L93 Difference]: Finished difference Result 1217 states and 4282 transitions. [2020-02-10 19:54:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:43,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:43,648 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 19:54:43,649 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:43,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 19:54:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:54:43,671 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:54:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:43,671 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:54:43,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:54:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:43,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:43,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:43,672 INFO L427 AbstractCegarLoop]: === Iteration 1199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 914056955, now seen corresponding path program 1192 times [2020-02-10 19:54:43,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:43,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916458297] [2020-02-10 19:54:43,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:43,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916458297] [2020-02-10 19:54:43,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:43,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908437825] [2020-02-10 19:54:43,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:43,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:43,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:43,995 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:54:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:44,133 INFO L93 Difference]: Finished difference Result 1213 states and 4272 transitions. [2020-02-10 19:54:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:44,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:44,136 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:54:44,136 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:54:44,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:54:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 775. [2020-02-10 19:54:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:54:44,158 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:54:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,158 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:54:44,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:54:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:44,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:44,159 INFO L427 AbstractCegarLoop]: === Iteration 1200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:44,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1480796069, now seen corresponding path program 1193 times [2020-02-10 19:54:44,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462140292] [2020-02-10 19:54:44,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:44,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 19:54:44,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462140292] [2020-02-10 19:54:44,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:44,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:44,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975717140] [2020-02-10 19:54:44,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:44,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:44,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:44,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:44,488 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:54:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:44,628 INFO L93 Difference]: Finished difference Result 1215 states and 4276 transitions. [2020-02-10 19:54:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:44,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:44,632 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:54:44,632 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 19:54:44,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 19:54:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-02-10 19:54:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:54:44,654 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:54:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,654 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:54:44,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:54:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:44,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:44,655 INFO L427 AbstractCegarLoop]: === Iteration 1201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash 407710689, now seen corresponding path program 1194 times [2020-02-10 19:54:44,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333475603] [2020-02-10 19:54:44,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:45,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333475603] [2020-02-10 19:54:45,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:45,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:45,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43102644] [2020-02-10 19:54:45,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:45,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:45,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:45,012 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:54:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:45,157 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 19:54:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:45,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:45,160 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:54:45,160 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 19:54:45,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 19:54:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 773. [2020-02-10 19:54:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:54:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 19:54:45,181 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 19:54:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:45,182 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 19:54:45,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 19:54:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:45,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:45,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] [2020-02-10 19:54:45,183 INFO L427 AbstractCegarLoop]: === Iteration 1202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -66697763, now seen corresponding path program 1195 times [2020-02-10 19:54:45,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:45,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170147855] [2020-02-10 19:54:45,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:45,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170147855] [2020-02-10 19:54:45,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:45,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:45,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486587206] [2020-02-10 19:54:45,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:45,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:45,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:45,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:45,516 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 19:54:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:45,671 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-02-10 19:54:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:45,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:45,674 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:54:45,675 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:54:45,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:54:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-02-10 19:54:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-02-10 19:54:45,696 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-02-10 19:54:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:45,696 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-02-10 19:54:45,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-02-10 19:54:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:45,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:45,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:45,698 INFO L427 AbstractCegarLoop]: === Iteration 1203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1544243195, now seen corresponding path program 1196 times [2020-02-10 19:54:45,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:45,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490128765] [2020-02-10 19:54:45,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:46,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 19:54:46,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490128765] [2020-02-10 19:54:46,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:46,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:46,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30985881] [2020-02-10 19:54:46,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:46,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:46,028 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:54:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:46,160 INFO L93 Difference]: Finished difference Result 1224 states and 4294 transitions. [2020-02-10 19:54:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:46,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:46,163 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 19:54:46,163 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 19:54:46,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 19:54:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 775. [2020-02-10 19:54:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:54:46,184 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:54:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:46,184 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:54:46,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:54:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:46,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:46,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] [2020-02-10 19:54:46,186 INFO L427 AbstractCegarLoop]: === Iteration 1204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1027393825, now seen corresponding path program 1197 times [2020-02-10 19:54:46,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:46,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906337025] [2020-02-10 19:54:46,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:46,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906337025] [2020-02-10 19:54:46,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:46,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:46,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513496860] [2020-02-10 19:54:46,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:46,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:46,505 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:54:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:46,661 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-02-10 19:54:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:46,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:46,665 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:46,665 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:54:46,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:54:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 19:54:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:54:46,687 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:54:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:46,687 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:54:46,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:54:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:46,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:46,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:46,688 INFO L427 AbstractCegarLoop]: === Iteration 1205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1565249403, now seen corresponding path program 1198 times [2020-02-10 19:54:46,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:46,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091926212] [2020-02-10 19:54:46,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:47,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 19:54:47,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091926212] [2020-02-10 19:54:47,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:47,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:47,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613069004] [2020-02-10 19:54:47,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:47,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:47,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:47,008 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:54:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:47,163 INFO L93 Difference]: Finished difference Result 1215 states and 4274 transitions. [2020-02-10 19:54:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:47,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:47,166 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:54:47,166 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:47,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 775. [2020-02-10 19:54:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:54:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 19:54:47,188 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 19:54:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:47,188 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 19:54:47,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 19:54:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:47,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:47,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:47,190 INFO L427 AbstractCegarLoop]: === Iteration 1206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1037896929, now seen corresponding path program 1199 times [2020-02-10 19:54:47,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:47,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833041763] [2020-02-10 19:54:47,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:47,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833041763] [2020-02-10 19:54:47,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:47,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:47,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709329953] [2020-02-10 19:54:47,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:47,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:47,526 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:54:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:47,651 INFO L93 Difference]: Finished difference Result 1216 states and 4276 transitions. [2020-02-10 19:54:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:47,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:47,655 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:54:47,655 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:47,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 19:54:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 19:54:47,676 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 19:54:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:47,676 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 19:54:47,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 19:54:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:47,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:47,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:47,677 INFO L427 AbstractCegarLoop]: === Iteration 1207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash -35188451, now seen corresponding path program 1200 times [2020-02-10 19:54:47,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:47,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860830720] [2020-02-10 19:54:47,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:48,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860830720] [2020-02-10 19:54:48,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:48,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:48,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867994200] [2020-02-10 19:54:48,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:48,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:48,007 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:54:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:48,157 INFO L93 Difference]: Finished difference Result 1213 states and 4268 transitions. [2020-02-10 19:54:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:48,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:48,160 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:54:48,160 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:54:48,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:54:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 769. [2020-02-10 19:54:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 19:54:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3070 transitions. [2020-02-10 19:54:48,182 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3070 transitions. Word has length 25 [2020-02-10 19:54:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:48,182 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3070 transitions. [2020-02-10 19:54:48,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3070 transitions. [2020-02-10 19:54:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:48,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:48,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] [2020-02-10 19:54:48,183 INFO L427 AbstractCegarLoop]: === Iteration 1208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash 765261477, now seen corresponding path program 1201 times [2020-02-10 19:54:48,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:48,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996745928] [2020-02-10 19:54:48,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:48,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 19:54:48,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996745928] [2020-02-10 19:54:48,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:48,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:48,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286707142] [2020-02-10 19:54:48,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:48,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:48,534 INFO L87 Difference]: Start difference. First operand 769 states and 3070 transitions. Second operand 10 states. [2020-02-10 19:54:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:48,683 INFO L93 Difference]: Finished difference Result 1206 states and 4266 transitions. [2020-02-10 19:54:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:48,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:48,686 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:54:48,686 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:48,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-02-10 19:54:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 19:54:48,708 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 19:54:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:48,708 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 19:54:48,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 19:54:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:48,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:48,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:48,709 INFO L427 AbstractCegarLoop]: === Iteration 1209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1746016195, now seen corresponding path program 1202 times [2020-02-10 19:54:48,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:48,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916352419] [2020-02-10 19:54:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:49,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916352419] [2020-02-10 19:54:49,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:49,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:49,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562747084] [2020-02-10 19:54:49,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:49,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:49,058 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:54:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:49,188 INFO L93 Difference]: Finished difference Result 1205 states and 4261 transitions. [2020-02-10 19:54:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:49,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:49,191 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 19:54:49,191 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:54:49,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:54:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:54:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 19:54:49,212 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 19:54:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:49,213 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 19:54:49,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 19:54:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:49,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:49,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:49,214 INFO L427 AbstractCegarLoop]: === Iteration 1210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1603671741, now seen corresponding path program 1203 times [2020-02-10 19:54:49,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:49,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345083805] [2020-02-10 19:54:49,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:49,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345083805] [2020-02-10 19:54:49,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:49,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:49,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848704459] [2020-02-10 19:54:49,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:49,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:49,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:49,555 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:54:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:49,689 INFO L93 Difference]: Finished difference Result 1211 states and 4274 transitions. [2020-02-10 19:54:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:49,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:49,693 INFO L225 Difference]: With dead ends: 1211 [2020-02-10 19:54:49,693 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:54:49,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:54:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 19:54:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 19:54:49,714 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 19:54:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:49,714 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 19:54:49,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 19:54:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:49,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:49,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:49,716 INFO L427 AbstractCegarLoop]: === Iteration 1211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash -612413919, now seen corresponding path program 1204 times [2020-02-10 19:54:49,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:49,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530328751] [2020-02-10 19:54:49,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:50,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 19:54:50,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530328751] [2020-02-10 19:54:50,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:50,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:50,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794887987] [2020-02-10 19:54:50,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:50,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:50,083 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:54:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:50,238 INFO L93 Difference]: Finished difference Result 1214 states and 4276 transitions. [2020-02-10 19:54:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:50,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:50,242 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:54:50,242 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:54:50,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:54:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 19:54:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 19:54:50,263 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 19:54:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:50,264 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 19:54:50,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 19:54:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:50,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:50,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:50,265 INFO L427 AbstractCegarLoop]: === Iteration 1212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:50,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:50,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1884729691, now seen corresponding path program 1205 times [2020-02-10 19:54:50,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:50,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17074763] [2020-02-10 19:54:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:50,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17074763] [2020-02-10 19:54:50,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:50,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:50,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42982061] [2020-02-10 19:54:50,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:50,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:50,607 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:54:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:50,742 INFO L93 Difference]: Finished difference Result 1208 states and 4264 transitions. [2020-02-10 19:54:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:50,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:50,746 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:50,746 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:50,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 19:54:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 19:54:50,767 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 19:54:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:50,767 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 19:54:50,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 19:54:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:50,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:50,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:50,768 INFO L427 AbstractCegarLoop]: === Iteration 1213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash -273788733, now seen corresponding path program 1206 times [2020-02-10 19:54:50,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:50,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211048844] [2020-02-10 19:54:50,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:51,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211048844] [2020-02-10 19:54:51,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:51,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:51,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469100978] [2020-02-10 19:54:51,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:51,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:51,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:51,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:51,113 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:54:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:51,247 INFO L93 Difference]: Finished difference Result 1212 states and 4269 transitions. [2020-02-10 19:54:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:51,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:51,250 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:54:51,250 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:54:51,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:54:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 774. [2020-02-10 19:54:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:54:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-02-10 19:54:51,272 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-02-10 19:54:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:51,272 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-02-10 19:54:51,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-02-10 19:54:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:51,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:51,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:51,273 INFO L427 AbstractCegarLoop]: === Iteration 1214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 342775751, now seen corresponding path program 1207 times [2020-02-10 19:54:51,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:51,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443609639] [2020-02-10 19:54:51,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:51,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443609639] [2020-02-10 19:54:51,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:51,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:51,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444719559] [2020-02-10 19:54:51,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:51,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:51,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:51,631 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:54:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:51,768 INFO L93 Difference]: Finished difference Result 1204 states and 4259 transitions. [2020-02-10 19:54:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:51,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:51,772 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:54:51,772 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:54:51,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:54:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 780. [2020-02-10 19:54:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-02-10 19:54:51,793 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-02-10 19:54:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:51,793 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-02-10 19:54:51,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-02-10 19:54:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:51,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:51,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:51,795 INFO L427 AbstractCegarLoop]: === Iteration 1215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:51,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:51,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1323530469, now seen corresponding path program 1208 times [2020-02-10 19:54:51,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:51,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348451320] [2020-02-10 19:54:51,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:52,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348451320] [2020-02-10 19:54:52,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:52,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:52,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919051430] [2020-02-10 19:54:52,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:52,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:52,150 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-02-10 19:54:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:52,320 INFO L93 Difference]: Finished difference Result 1203 states and 4254 transitions. [2020-02-10 19:54:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:52,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:52,323 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:54:52,323 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:54:52,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:54:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 19:54:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 19:54:52,345 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 19:54:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:52,345 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 19:54:52,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 19:54:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:52,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:52,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:52,346 INFO L427 AbstractCegarLoop]: === Iteration 1216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -100123389, now seen corresponding path program 1209 times [2020-02-10 19:54:52,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:52,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778268999] [2020-02-10 19:54:52,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:52,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 19:54:52,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778268999] [2020-02-10 19:54:52,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:52,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:52,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843110051] [2020-02-10 19:54:52,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:52,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:52,720 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:54:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:52,911 INFO L93 Difference]: Finished difference Result 1207 states and 4263 transitions. [2020-02-10 19:54:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:52,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:52,915 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:54:52,915 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:54:52,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:54:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 19:54:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:54:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 19:54:52,938 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 19:54:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:52,939 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 19:54:52,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 19:54:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:52,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:52,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:52,940 INFO L427 AbstractCegarLoop]: === Iteration 1217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash 901637537, now seen corresponding path program 1210 times [2020-02-10 19:54:52,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:52,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490675662] [2020-02-10 19:54:52,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:53,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490675662] [2020-02-10 19:54:53,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:53,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:53,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387367395] [2020-02-10 19:54:53,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:53,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:53,292 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:54:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,462 INFO L93 Difference]: Finished difference Result 1208 states and 4261 transitions. [2020-02-10 19:54:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:53,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,465 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:53,466 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:54:53,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:54:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:54:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 19:54:53,487 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 19:54:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:53,487 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 19:54:53,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 19:54:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:53,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:53,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:53,489 INFO L427 AbstractCegarLoop]: === Iteration 1218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1981619193, now seen corresponding path program 1211 times [2020-02-10 19:54:53,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:53,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513818627] [2020-02-10 19:54:53,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:53,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513818627] [2020-02-10 19:54:53,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:53,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:53,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882213279] [2020-02-10 19:54:53,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:53,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:53,835 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:54:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,985 INFO L93 Difference]: Finished difference Result 1204 states and 4253 transitions. [2020-02-10 19:54:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:53,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,988 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:54:53,989 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:54:53,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:54:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-02-10 19:54:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 19:54:54,010 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 19:54:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:54,010 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 19:54:54,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 19:54:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:54,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:54,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:54,012 INFO L427 AbstractCegarLoop]: === Iteration 1219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1240262723, now seen corresponding path program 1212 times [2020-02-10 19:54:54,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:54,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412724946] [2020-02-10 19:54:54,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:54,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 19:54:54,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412724946] [2020-02-10 19:54:54,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:54,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:54,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149004838] [2020-02-10 19:54:54,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:54,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:54,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:54,369 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:54:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:54,540 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-02-10 19:54:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:54,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:54,544 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:54:54,544 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:54:54,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:54:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-02-10 19:54:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:54:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3089 transitions. [2020-02-10 19:54:54,566 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3089 transitions. Word has length 25 [2020-02-10 19:54:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:54,566 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3089 transitions. [2020-02-10 19:54:54,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3089 transitions. [2020-02-10 19:54:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:54,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:54,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:54,567 INFO L427 AbstractCegarLoop]: === Iteration 1220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1846324103, now seen corresponding path program 1213 times [2020-02-10 19:54:54,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:54,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795808034] [2020-02-10 19:54:54,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:54,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795808034] [2020-02-10 19:54:54,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:54,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:54,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022044696] [2020-02-10 19:54:54,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:54,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:54,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:54,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:54,907 INFO L87 Difference]: Start difference. First operand 774 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:54:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:55,084 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-02-10 19:54:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:55,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:55,088 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 19:54:55,088 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 19:54:55,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 19:54:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 782. [2020-02-10 19:54:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:54:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3111 transitions. [2020-02-10 19:54:55,110 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3111 transitions. Word has length 25 [2020-02-10 19:54:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:55,110 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3111 transitions. [2020-02-10 19:54:55,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3111 transitions. [2020-02-10 19:54:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:55,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:55,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:55,111 INFO L427 AbstractCegarLoop]: === Iteration 1221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:55,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:55,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1457385371, now seen corresponding path program 1214 times [2020-02-10 19:54:55,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:55,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499508677] [2020-02-10 19:54:55,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:55,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499508677] [2020-02-10 19:54:55,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:55,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:55,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219135315] [2020-02-10 19:54:55,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:55,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:55,455 INFO L87 Difference]: Start difference. First operand 782 states and 3111 transitions. Second operand 10 states. [2020-02-10 19:54:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:55,622 INFO L93 Difference]: Finished difference Result 1220 states and 4290 transitions. [2020-02-10 19:54:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:55,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:55,625 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:55,626 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:54:55,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:54:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 778. [2020-02-10 19:54:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:54:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 19:54:55,647 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 19:54:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:55,647 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 19:54:55,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 19:54:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:55,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:55,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:55,649 INFO L427 AbstractCegarLoop]: === Iteration 1222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash -522609115, now seen corresponding path program 1215 times [2020-02-10 19:54:55,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:55,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029044538] [2020-02-10 19:54:55,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:55,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029044538] [2020-02-10 19:54:55,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:55,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:55,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237354845] [2020-02-10 19:54:55,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:55,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:55,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:55,999 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:54:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:56,135 INFO L93 Difference]: Finished difference Result 1215 states and 4280 transitions. [2020-02-10 19:54:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:56,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:56,138 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 19:54:56,138 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:54:56,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:54:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 19:54:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:54:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 19:54:56,160 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 19:54:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:56,160 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 19:54:56,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 19:54:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:56,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:56,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:56,161 INFO L427 AbstractCegarLoop]: === Iteration 1223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash 479151811, now seen corresponding path program 1216 times [2020-02-10 19:54:56,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:56,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838563714] [2020-02-10 19:54:56,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:56,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 19:54:56,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838563714] [2020-02-10 19:54:56,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:56,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:56,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453947123] [2020-02-10 19:54:56,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:56,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:56,508 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:54:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:56,681 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-02-10 19:54:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:56,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:56,684 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:54:56,685 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:54:56,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:54:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 778. [2020-02-10 19:54:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:54:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:54:56,706 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:54:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:56,706 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:54:56,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:54:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:56,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:56,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:56,707 INFO L427 AbstractCegarLoop]: === Iteration 1224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash -467567737, now seen corresponding path program 1217 times [2020-02-10 19:54:56,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:56,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756312588] [2020-02-10 19:54:56,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:57,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 19:54:57,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756312588] [2020-02-10 19:54:57,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:57,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:57,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067998445] [2020-02-10 19:54:57,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:57,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:57,048 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:54:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,216 INFO L93 Difference]: Finished difference Result 1222 states and 4291 transitions. [2020-02-10 19:54:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:57,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,220 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:54:57,220 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:54:57,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:54:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-02-10 19:54:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:54:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 19:54:57,242 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 19:54:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,242 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 19:54:57,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 19:54:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:57,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:57,243 INFO L427 AbstractCegarLoop]: === Iteration 1225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1143373221, now seen corresponding path program 1218 times [2020-02-10 19:54:57,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496367911] [2020-02-10 19:54:57,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:57,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496367911] [2020-02-10 19:54:57,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:57,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:57,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261429944] [2020-02-10 19:54:57,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:57,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:57,586 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:54:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,767 INFO L93 Difference]: Finished difference Result 1220 states and 4282 transitions. [2020-02-10 19:54:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:57,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,771 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:54:57,771 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 19:54:57,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 19:54:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 774. [2020-02-10 19:54:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:54:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3086 transitions. [2020-02-10 19:54:57,792 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3086 transitions. Word has length 25 [2020-02-10 19:54:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,793 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3086 transitions. [2020-02-10 19:54:57,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3086 transitions. [2020-02-10 19:54:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:57,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:57,794 INFO L427 AbstractCegarLoop]: === Iteration 1226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1265154109, now seen corresponding path program 1219 times [2020-02-10 19:54:57,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533552987] [2020-02-10 19:54:57,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:58,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 19:54:58,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533552987] [2020-02-10 19:54:58,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:58,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:58,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513740059] [2020-02-10 19:54:58,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:58,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:58,123 INFO L87 Difference]: Start difference. First operand 774 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:54:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:58,287 INFO L93 Difference]: Finished difference Result 1210 states and 4266 transitions. [2020-02-10 19:54:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:58,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:58,291 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:54:58,291 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:54:58,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:54:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-02-10 19:54:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 19:54:58,312 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 19:54:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:58,312 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 19:54:58,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 19:54:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:58,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:58,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:58,314 INFO L427 AbstractCegarLoop]: === Iteration 1227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash 345786849, now seen corresponding path program 1220 times [2020-02-10 19:54:58,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:58,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192989757] [2020-02-10 19:54:58,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:58,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192989757] [2020-02-10 19:54:58,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:58,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:58,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541155768] [2020-02-10 19:54:58,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:58,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:58,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:58,646 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:54:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:58,782 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-02-10 19:54:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:58,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:58,785 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:54:58,785 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:54:58,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:54:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 19:54:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:54:58,806 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:54:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:58,806 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:54:58,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:54:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:58,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:58,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:58,807 INFO L427 AbstractCegarLoop]: === Iteration 1228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1429375333, now seen corresponding path program 1221 times [2020-02-10 19:54:58,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:58,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744856969] [2020-02-10 19:54:58,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:59,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744856969] [2020-02-10 19:54:59,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:59,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:59,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640373958] [2020-02-10 19:54:59,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:59,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:59,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:59,146 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:54:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:59,293 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-02-10 19:54:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:59,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:59,297 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:54:59,297 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:54:59,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:54:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 19:54:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:54:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-02-10 19:54:59,318 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-02-10 19:54:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:59,318 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-02-10 19:54:59,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-02-10 19:54:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:59,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:59,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:59,320 INFO L427 AbstractCegarLoop]: === Iteration 1229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 356289953, now seen corresponding path program 1222 times [2020-02-10 19:54:59,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:59,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793147702] [2020-02-10 19:54:59,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:59,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793147702] [2020-02-10 19:54:59,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:59,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:54:59,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494350218] [2020-02-10 19:54:59,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:54:59,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:54:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:54:59,650 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-02-10 19:54:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:59,818 INFO L93 Difference]: Finished difference Result 1210 states and 4260 transitions. [2020-02-10 19:54:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:54:59,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:54:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:59,821 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:54:59,821 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:54:59,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:54:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 19:54:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:54:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-02-10 19:54:59,843 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-02-10 19:54:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:59,843 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-02-10 19:54:59,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:54:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-02-10 19:54:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:54:59,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:59,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:59,844 INFO L427 AbstractCegarLoop]: === Iteration 1230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:59,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1439878437, now seen corresponding path program 1223 times [2020-02-10 19:54:59,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:59,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803039306] [2020-02-10 19:54:59,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:00,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803039306] [2020-02-10 19:55:00,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:00,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:00,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271023918] [2020-02-10 19:55:00,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:00,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:00,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:00,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:00,186 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:55:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:00,337 INFO L93 Difference]: Finished difference Result 1218 states and 4278 transitions. [2020-02-10 19:55:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:00,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:00,341 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:55:00,341 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:55:00,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:55:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 19:55:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:55:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-02-10 19:55:00,362 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-02-10 19:55:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:00,362 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-02-10 19:55:00,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-02-10 19:55:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:00,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:00,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:00,363 INFO L427 AbstractCegarLoop]: === Iteration 1231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1244147901, now seen corresponding path program 1224 times [2020-02-10 19:55:00,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:00,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928480373] [2020-02-10 19:55:00,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:00,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928480373] [2020-02-10 19:55:00,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:00,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:00,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438099861] [2020-02-10 19:55:00,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:00,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:00,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:00,699 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:55:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:00,872 INFO L93 Difference]: Finished difference Result 1216 states and 4269 transitions. [2020-02-10 19:55:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:00,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:00,876 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 19:55:00,876 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 19:55:00,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 19:55:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 771. [2020-02-10 19:55:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:55:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 19:55:00,898 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 19:55:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:00,898 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 19:55:00,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 19:55:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:00,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:00,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:00,899 INFO L427 AbstractCegarLoop]: === Iteration 1232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash 340950241, now seen corresponding path program 1225 times [2020-02-10 19:55:00,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:00,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693801648] [2020-02-10 19:55:00,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:01,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 19:55:01,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693801648] [2020-02-10 19:55:01,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:01,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:01,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795304666] [2020-02-10 19:55:01,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:01,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:01,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:01,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:01,251 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 19:55:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,401 INFO L93 Difference]: Finished difference Result 1192 states and 4219 transitions. [2020-02-10 19:55:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:01,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,403 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:01,403 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:55:01,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:55:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 19:55:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 19:55:01,425 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 19:55:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:01,426 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 19:55:01,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 19:55:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:01,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:01,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] [2020-02-10 19:55:01,427 INFO L427 AbstractCegarLoop]: === Iteration 1233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1321704959, now seen corresponding path program 1226 times [2020-02-10 19:55:01,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:01,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277906257] [2020-02-10 19:55:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:01,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277906257] [2020-02-10 19:55:01,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:01,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:01,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170650984] [2020-02-10 19:55:01,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:01,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:01,778 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 19:55:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,955 INFO L93 Difference]: Finished difference Result 1191 states and 4214 transitions. [2020-02-10 19:55:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:01,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,958 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:55:01,959 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:01,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 19:55:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:55:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 19:55:01,980 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:01,980 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 19:55:01,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 19:55:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:01,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:01,981 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:01,981 INFO L427 AbstractCegarLoop]: === Iteration 1234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2027982977, now seen corresponding path program 1227 times [2020-02-10 19:55:01,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:01,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592876977] [2020-02-10 19:55:01,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:02,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 19:55:02,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592876977] [2020-02-10 19:55:02,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:02,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:02,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566959845] [2020-02-10 19:55:02,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:02,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:02,328 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:02,496 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-02-10 19:55:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:02,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:02,500 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:55:02,500 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:55:02,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:55:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 780. [2020-02-10 19:55:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 19:55:02,521 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 19:55:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:02,522 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 19:55:02,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 19:55:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:02,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:02,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:02,523 INFO L427 AbstractCegarLoop]: === Iteration 1235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1036725155, now seen corresponding path program 1228 times [2020-02-10 19:55:02,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:02,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137441310] [2020-02-10 19:55:02,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:02,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137441310] [2020-02-10 19:55:02,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:02,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:02,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635226257] [2020-02-10 19:55:02,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:02,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:02,867 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:55:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:03,053 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 19:55:03,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:03,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:03,056 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:55:03,056 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:55:03,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:55:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 776. [2020-02-10 19:55:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:55:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 19:55:03,077 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 19:55:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:03,077 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 19:55:03,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 19:55:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:03,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:03,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:03,079 INFO L427 AbstractCegarLoop]: === Iteration 1236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1985926369, now seen corresponding path program 1229 times [2020-02-10 19:55:03,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:03,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774505049] [2020-02-10 19:55:03,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:03,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774505049] [2020-02-10 19:55:03,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:03,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:03,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641721590] [2020-02-10 19:55:03,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:03,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:03,419 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 19:55:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:03,589 INFO L93 Difference]: Finished difference Result 1194 states and 4217 transitions. [2020-02-10 19:55:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:03,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:03,592 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:55:03,592 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:03,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 19:55:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:55:03,619 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:55:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:03,619 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:55:03,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:55:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:03,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:03,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:03,621 INFO L427 AbstractCegarLoop]: === Iteration 1237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash -698099969, now seen corresponding path program 1230 times [2020-02-10 19:55:03,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:03,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742138496] [2020-02-10 19:55:03,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:03,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742138496] [2020-02-10 19:55:03,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:03,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:03,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343005997] [2020-02-10 19:55:03,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:03,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:03,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:03,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:03,981 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:55:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:04,105 INFO L93 Difference]: Finished difference Result 1198 states and 4222 transitions. [2020-02-10 19:55:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:04,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:04,109 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:55:04,109 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:04,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 773. [2020-02-10 19:55:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 19:55:04,130 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 19:55:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:04,131 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 19:55:04,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 19:55:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:04,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:04,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:04,132 INFO L427 AbstractCegarLoop]: === Iteration 1238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash -926506937, now seen corresponding path program 1231 times [2020-02-10 19:55:04,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:04,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759827773] [2020-02-10 19:55:04,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:04,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 19:55:04,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759827773] [2020-02-10 19:55:04,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:04,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:04,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154228634] [2020-02-10 19:55:04,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:04,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:04,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:04,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:04,504 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:55:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:04,625 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-02-10 19:55:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:04,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:04,628 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:55:04,628 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:04,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-02-10 19:55:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:55:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 19:55:04,650 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 19:55:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:04,650 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 19:55:04,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 19:55:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:04,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:04,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:04,651 INFO L427 AbstractCegarLoop]: === Iteration 1239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 54247781, now seen corresponding path program 1232 times [2020-02-10 19:55:04,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:04,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6162416] [2020-02-10 19:55:04,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:05,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6162416] [2020-02-10 19:55:05,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:05,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312794925] [2020-02-10 19:55:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:05,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:05,009 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:55:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:05,130 INFO L93 Difference]: Finished difference Result 1182 states and 4189 transitions. [2020-02-10 19:55:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:05,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:05,134 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:55:05,134 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:55:05,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:55:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 19:55:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 19:55:05,155 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 19:55:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:05,155 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 19:55:05,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 19:55:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:05,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:05,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:05,156 INFO L427 AbstractCegarLoop]: === Iteration 1240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1812305217, now seen corresponding path program 1233 times [2020-02-10 19:55:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:05,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966560148] [2020-02-10 19:55:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:05,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966560148] [2020-02-10 19:55:05,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:05,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029634467] [2020-02-10 19:55:05,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:05,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:05,510 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:55:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:05,652 INFO L93 Difference]: Finished difference Result 1181 states and 4187 transitions. [2020-02-10 19:55:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:05,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:05,656 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:55:05,656 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:05,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 19:55:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 19:55:05,679 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 19:55:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:05,679 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 19:55:05,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 19:55:05,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:05,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:05,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] [2020-02-10 19:55:05,681 INFO L427 AbstractCegarLoop]: === Iteration 1241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash -789538083, now seen corresponding path program 1234 times [2020-02-10 19:55:05,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:05,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259345914] [2020-02-10 19:55:05,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:06,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259345914] [2020-02-10 19:55:06,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:06,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:06,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155458060] [2020-02-10 19:55:06,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:06,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:06,029 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:55:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:06,156 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 19:55:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:06,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:06,159 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:55:06,159 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:55:06,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:55:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 19:55:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:55:06,180 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:55:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:06,180 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:55:06,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:55:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:06,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:06,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:06,182 INFO L427 AbstractCegarLoop]: === Iteration 1242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:06,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1695257863, now seen corresponding path program 1235 times [2020-02-10 19:55:06,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:06,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895887538] [2020-02-10 19:55:06,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:06,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895887538] [2020-02-10 19:55:06,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:06,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:06,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405795798] [2020-02-10 19:55:06,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:06,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:06,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:06,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:06,538 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:55:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:06,674 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 19:55:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:06,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:06,677 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:55:06,677 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:55:06,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:55:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 19:55:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:55:06,699 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:06,699 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:55:06,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:55:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:06,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:06,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] [2020-02-10 19:55:06,701 INFO L427 AbstractCegarLoop]: === Iteration 1243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash -450912897, now seen corresponding path program 1236 times [2020-02-10 19:55:06,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:06,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563712997] [2020-02-10 19:55:06,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:07,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563712997] [2020-02-10 19:55:07,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:07,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:07,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528732620] [2020-02-10 19:55:07,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:07,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:07,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:07,045 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,165 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-02-10 19:55:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:07,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,168 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 19:55:07,169 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 19:55:07,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 19:55:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 773. [2020-02-10 19:55:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:55:07,190 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:55:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,190 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:55:07,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:55:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:07,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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] [2020-02-10 19:55:07,191 INFO L427 AbstractCegarLoop]: === Iteration 1244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,192 INFO L82 PathProgramCache]: Analyzing trace with hash 577041415, now seen corresponding path program 1237 times [2020-02-10 19:55:07,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255055524] [2020-02-10 19:55:07,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:07,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 19:55:07,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255055524] [2020-02-10 19:55:07,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:07,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:07,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110576526] [2020-02-10 19:55:07,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:07,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:07,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:07,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:07,529 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:55:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,647 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 19:55:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:07,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,650 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:55:07,650 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:55:07,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:55:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-02-10 19:55:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:55:07,671 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:55:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,672 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:55:07,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:55:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:07,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:07,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:07,673 INFO L427 AbstractCegarLoop]: === Iteration 1245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1568299237, now seen corresponding path program 1238 times [2020-02-10 19:55:07,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562813311] [2020-02-10 19:55:07,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:08,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562813311] [2020-02-10 19:55:08,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:08,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768803475] [2020-02-10 19:55:08,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:08,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:08,012 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:55:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:08,134 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-02-10 19:55:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:08,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:08,138 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:55:08,138 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:08,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 19:55:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:55:08,159 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:55:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:08,159 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:55:08,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:55:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:08,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:08,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:08,161 INFO L427 AbstractCegarLoop]: === Iteration 1246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:08,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2060176353, now seen corresponding path program 1239 times [2020-02-10 19:55:08,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:08,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956291895] [2020-02-10 19:55:08,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,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 19:55:08,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956291895] [2020-02-10 19:55:08,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:08,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915284193] [2020-02-10 19:55:08,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:08,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:08,511 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:55:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:08,629 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 19:55:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:08,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:08,632 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:55:08,632 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:55:08,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:55:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 19:55:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:55:08,653 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:08,653 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:55:08,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:55:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:08,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:08,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:08,655 INFO L427 AbstractCegarLoop]: === Iteration 1247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1212023809, now seen corresponding path program 1240 times [2020-02-10 19:55:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:08,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530102160] [2020-02-10 19:55:08,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:08,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530102160] [2020-02-10 19:55:08,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:08,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086130427] [2020-02-10 19:55:08,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:08,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:08,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:08,998 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:09,122 INFO L93 Difference]: Finished difference Result 1184 states and 4190 transitions. [2020-02-10 19:55:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:09,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:09,125 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:55:09,125 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:55:09,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:55:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 19:55:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:55:09,146 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:09,146 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:55:09,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:55:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:09,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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] [2020-02-10 19:55:09,148 INFO L427 AbstractCegarLoop]: === Iteration 1248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1085657977, now seen corresponding path program 1241 times [2020-02-10 19:55:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054056387] [2020-02-10 19:55:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:09,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054056387] [2020-02-10 19:55:09,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:09,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:09,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610466651] [2020-02-10 19:55:09,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:09,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:09,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:09,480 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:09,599 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-02-10 19:55:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:09,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:09,602 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:09,602 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:09,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:55:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:55:09,624 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:09,624 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:55:09,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:55:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:09,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:09,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:09,625 INFO L427 AbstractCegarLoop]: === Iteration 1249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash -547802399, now seen corresponding path program 1242 times [2020-02-10 19:55:09,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:09,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843214738] [2020-02-10 19:55:09,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:09,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843214738] [2020-02-10 19:55:09,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:09,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:09,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252312214] [2020-02-10 19:55:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:09,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:09,953 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:10,074 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-02-10 19:55:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:10,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:10,078 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:55:10,078 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:55:10,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:55:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 19:55:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:55:10,099 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:55:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:10,099 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:55:10,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:55:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:10,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:10,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:10,100 INFO L427 AbstractCegarLoop]: === Iteration 1250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:10,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1317631359, now seen corresponding path program 1243 times [2020-02-10 19:55:10,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:10,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100224083] [2020-02-10 19:55:10,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:10,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100224083] [2020-02-10 19:55:10,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:10,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265678173] [2020-02-10 19:55:10,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:10,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:10,442 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:55:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:10,564 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-02-10 19:55:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:10,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:10,567 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:55:10,568 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:10,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 778. [2020-02-10 19:55:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:55:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 19:55:10,589 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 19:55:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:10,589 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 19:55:10,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 19:55:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:10,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:10,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] [2020-02-10 19:55:10,590 INFO L427 AbstractCegarLoop]: === Iteration 1251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1366394979, now seen corresponding path program 1244 times [2020-02-10 19:55:10,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:10,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129574886] [2020-02-10 19:55:10,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:10,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129574886] [2020-02-10 19:55:10,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:10,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881520409] [2020-02-10 19:55:10,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:10,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:10,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:10,941 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:55:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,068 INFO L93 Difference]: Finished difference Result 1192 states and 4205 transitions. [2020-02-10 19:55:11,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:11,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,071 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:11,071 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:55:11,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:55:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 19:55:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:55:11,093 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,093 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:55:11,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:55:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:11,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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] [2020-02-10 19:55:11,094 INFO L427 AbstractCegarLoop]: === Iteration 1252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 811285093, now seen corresponding path program 1245 times [2020-02-10 19:55:11,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266332588] [2020-02-10 19:55:11,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:11,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 19:55:11,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266332588] [2020-02-10 19:55:11,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:11,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:11,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082960846] [2020-02-10 19:55:11,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:11,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:11,454 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,573 INFO L93 Difference]: Finished difference Result 1182 states and 4185 transitions. [2020-02-10 19:55:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:11,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,577 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:55:11,577 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:11,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:55:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:55:11,598 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,598 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:55:11,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:55:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:11,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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] [2020-02-10 19:55:11,600 INFO L427 AbstractCegarLoop]: === Iteration 1253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1334885667, now seen corresponding path program 1246 times [2020-02-10 19:55:11,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721532647] [2020-02-10 19:55:11,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:11,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721532647] [2020-02-10 19:55:11,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:11,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:11,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651743587] [2020-02-10 19:55:11,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:11,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:11,946 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:12,069 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-02-10 19:55:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:12,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:12,073 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:55:12,073 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:12,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 19:55:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:55:12,094 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:55:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:12,094 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:55:12,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:55:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:12,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:12,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:12,095 INFO L427 AbstractCegarLoop]: === Iteration 1254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash 821788197, now seen corresponding path program 1247 times [2020-02-10 19:55:12,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:12,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969454550] [2020-02-10 19:55:12,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:12,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969454550] [2020-02-10 19:55:12,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:12,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:12,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299172348] [2020-02-10 19:55:12,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:12,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:12,442 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:55:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:12,558 INFO L93 Difference]: Finished difference Result 1190 states and 4199 transitions. [2020-02-10 19:55:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:12,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:12,562 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:55:12,562 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:55:12,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:55:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 777. [2020-02-10 19:55:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:55:12,583 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:55:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:12,583 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:55:12,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:55:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:12,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:12,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:12,584 INFO L427 AbstractCegarLoop]: === Iteration 1255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1359643775, now seen corresponding path program 1248 times [2020-02-10 19:55:12,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:12,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454056908] [2020-02-10 19:55:12,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:12,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454056908] [2020-02-10 19:55:12,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:12,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:12,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257770685] [2020-02-10 19:55:12,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:12,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:12,921 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:55:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:13,055 INFO L93 Difference]: Finished difference Result 1185 states and 4187 transitions. [2020-02-10 19:55:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:13,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:13,059 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 19:55:13,059 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:13,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 771. [2020-02-10 19:55:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:55:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 19:55:13,080 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 19:55:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:13,080 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 19:55:13,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 19:55:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:13,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:13,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:13,081 INFO L427 AbstractCegarLoop]: === Iteration 1256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash -293691103, now seen corresponding path program 1249 times [2020-02-10 19:55:13,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:13,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580399029] [2020-02-10 19:55:13,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:13,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580399029] [2020-02-10 19:55:13,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:13,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:13,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712125724] [2020-02-10 19:55:13,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:13,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:13,445 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 19:55:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:13,581 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-02-10 19:55:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:13,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:13,584 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:55:13,584 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:55:13,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:55:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-02-10 19:55:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:55:13,605 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:55:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:13,605 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:55:13,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:55:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:13,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:13,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:13,606 INFO L427 AbstractCegarLoop]: === Iteration 1257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 687063615, now seen corresponding path program 1250 times [2020-02-10 19:55:13,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:13,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115455876] [2020-02-10 19:55:13,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:13,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115455876] [2020-02-10 19:55:13,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:13,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:13,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809668874] [2020-02-10 19:55:13,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:13,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:13,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:13,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:13,972 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:55:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:14,092 INFO L93 Difference]: Finished difference Result 1187 states and 4204 transitions. [2020-02-10 19:55:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:14,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:14,095 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:55:14,095 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:55:14,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:55:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 776. [2020-02-10 19:55:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:55:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 19:55:14,117 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 19:55:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:14,117 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 19:55:14,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 19:55:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:14,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:14,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:14,118 INFO L427 AbstractCegarLoop]: === Iteration 1258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:14,118 INFO L82 PathProgramCache]: Analyzing trace with hash -736590243, now seen corresponding path program 1251 times [2020-02-10 19:55:14,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:14,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281668179] [2020-02-10 19:55:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:14,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281668179] [2020-02-10 19:55:14,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:14,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:14,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216040522] [2020-02-10 19:55:14,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:14,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:14,475 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:55:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:14,597 INFO L93 Difference]: Finished difference Result 1191 states and 4213 transitions. [2020-02-10 19:55:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:14,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:14,600 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:55:14,600 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:14,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 780. [2020-02-10 19:55:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3101 transitions. [2020-02-10 19:55:14,621 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3101 transitions. Word has length 25 [2020-02-10 19:55:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:14,621 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3101 transitions. [2020-02-10 19:55:14,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3101 transitions. [2020-02-10 19:55:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:14,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:14,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:14,623 INFO L427 AbstractCegarLoop]: === Iteration 1259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash 265170683, now seen corresponding path program 1252 times [2020-02-10 19:55:14,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:14,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890598327] [2020-02-10 19:55:14,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:14,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890598327] [2020-02-10 19:55:14,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:14,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:14,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234011067] [2020-02-10 19:55:14,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:14,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:14,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:14,977 INFO L87 Difference]: Start difference. First operand 780 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:55:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,104 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-02-10 19:55:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:15,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,107 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:15,108 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:55:15,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:55:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 776. [2020-02-10 19:55:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:55:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 19:55:15,129 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 19:55:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:15,129 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 19:55:15,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 19:55:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:15,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:15,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:15,130 INFO L427 AbstractCegarLoop]: === Iteration 1260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1676881249, now seen corresponding path program 1253 times [2020-02-10 19:55:15,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:15,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891294115] [2020-02-10 19:55:15,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:15,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891294115] [2020-02-10 19:55:15,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:15,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:15,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003080007] [2020-02-10 19:55:15,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:15,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:15,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:15,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:15,486 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:55:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,603 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-02-10 19:55:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:15,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,607 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:55:15,607 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:15,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 19:55:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:55:15,628 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:15,628 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:55:15,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:55:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:15,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:15,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] [2020-02-10 19:55:15,630 INFO L427 AbstractCegarLoop]: === Iteration 1261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 603795869, now seen corresponding path program 1254 times [2020-02-10 19:55:15,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:15,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129971727] [2020-02-10 19:55:15,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:15,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129971727] [2020-02-10 19:55:15,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:15,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:15,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259061670] [2020-02-10 19:55:15,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:15,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:15,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:15,981 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:16,105 INFO L93 Difference]: Finished difference Result 1190 states and 4204 transitions. [2020-02-10 19:55:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:16,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:16,109 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:55:16,109 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:16,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 773. [2020-02-10 19:55:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:55:16,130 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:55:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:16,130 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:55:16,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:55:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:16,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:16,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:16,132 INFO L427 AbstractCegarLoop]: === Iteration 1262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:16,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1138662555, now seen corresponding path program 1255 times [2020-02-10 19:55:16,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:16,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158224758] [2020-02-10 19:55:16,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:16,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158224758] [2020-02-10 19:55:16,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:16,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:16,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131707176] [2020-02-10 19:55:16,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:16,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:16,513 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:55:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:16,642 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 19:55:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:16,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:16,646 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:55:16,647 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:16,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-02-10 19:55:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:55:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:55:16,668 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:16,669 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:55:16,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:55:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:16,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:16,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:16,670 INFO L427 AbstractCegarLoop]: === Iteration 1263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash -157907837, now seen corresponding path program 1256 times [2020-02-10 19:55:16,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:16,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521557132] [2020-02-10 19:55:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:17,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521557132] [2020-02-10 19:55:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539520240] [2020-02-10 19:55:17,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:17,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:17,024 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:17,154 INFO L93 Difference]: Finished difference Result 1180 states and 4183 transitions. [2020-02-10 19:55:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:17,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:17,158 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:55:17,158 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:55:17,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:55:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-02-10 19:55:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:55:17,179 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:55:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:17,179 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:55:17,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:55:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:17,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:17,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:17,180 INFO L427 AbstractCegarLoop]: === Iteration 1264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2024460835, now seen corresponding path program 1257 times [2020-02-10 19:55:17,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:17,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267988711] [2020-02-10 19:55:17,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:17,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267988711] [2020-02-10 19:55:17,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:17,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:17,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029083263] [2020-02-10 19:55:17,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:17,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:17,536 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:55:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:17,663 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 19:55:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:17,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:17,667 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:55:17,667 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:55:17,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:55:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 19:55:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:55:17,688 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:17,688 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:55:17,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:55:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:17,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:17,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:17,689 INFO L427 AbstractCegarLoop]: === Iteration 1265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1001693701, now seen corresponding path program 1258 times [2020-02-10 19:55:17,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:17,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768619879] [2020-02-10 19:55:17,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:18,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768619879] [2020-02-10 19:55:18,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:18,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:18,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219736017] [2020-02-10 19:55:18,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:18,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:18,054 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,195 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 19:55:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:18,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,199 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 19:55:18,199 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:55:18,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:55:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 19:55:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:55:18,222 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:18,222 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:55:18,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:55:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:18,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:18,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:18,223 INFO L427 AbstractCegarLoop]: === Iteration 1266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1483102245, now seen corresponding path program 1259 times [2020-02-10 19:55:18,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:18,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655220911] [2020-02-10 19:55:18,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:18,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655220911] [2020-02-10 19:55:18,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:18,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:18,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011860401] [2020-02-10 19:55:18,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:18,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:18,582 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,705 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 19:55:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:18,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,709 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 19:55:18,709 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 19:55:18,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 19:55:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 19:55:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:55:18,729 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:18,730 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:55:18,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:55:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:18,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:18,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] [2020-02-10 19:55:18,731 INFO L427 AbstractCegarLoop]: === Iteration 1267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -663068515, now seen corresponding path program 1260 times [2020-02-10 19:55:18,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:18,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707389085] [2020-02-10 19:55:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:19,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707389085] [2020-02-10 19:55:19,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:19,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:19,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873618126] [2020-02-10 19:55:19,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:19,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:19,092 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:19,245 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-02-10 19:55:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:19,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:19,249 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 19:55:19,249 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 19:55:19,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 19:55:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-02-10 19:55:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:55:19,269 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:55:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:19,270 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:55:19,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:55:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:19,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:19,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:19,271 INFO L427 AbstractCegarLoop]: === Iteration 1268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1868434149, now seen corresponding path program 1261 times [2020-02-10 19:55:19,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:19,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723276109] [2020-02-10 19:55:19,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:19,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723276109] [2020-02-10 19:55:19,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:19,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:19,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201064938] [2020-02-10 19:55:19,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:19,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:19,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:19,621 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:55:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:19,747 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-02-10 19:55:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:19,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:19,750 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:55:19,751 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:55:19,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:55:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-02-10 19:55:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:55:19,773 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:19,773 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:55:19,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:55:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:19,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:19,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:19,774 INFO L427 AbstractCegarLoop]: === Iteration 1269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1424772221, now seen corresponding path program 1262 times [2020-02-10 19:55:19,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:19,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321957103] [2020-02-10 19:55:19,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:20,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321957103] [2020-02-10 19:55:20,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:20,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:20,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983649297] [2020-02-10 19:55:20,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:20,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:20,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:20,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:20,131 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:20,270 INFO L93 Difference]: Finished difference Result 1188 states and 4198 transitions. [2020-02-10 19:55:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:20,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:20,273 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:55:20,274 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:20,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 19:55:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:55:20,295 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:20,295 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:55:20,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:55:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:20,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:20,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:20,296 INFO L427 AbstractCegarLoop]: === Iteration 1270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:20,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1425535009, now seen corresponding path program 1263 times [2020-02-10 19:55:20,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:20,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989621462] [2020-02-10 19:55:20,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:20,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989621462] [2020-02-10 19:55:20,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:20,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:20,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509493503] [2020-02-10 19:55:20,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:20,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:20,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:20,651 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:20,809 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-02-10 19:55:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:20,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:20,812 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:55:20,813 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 19:55:20,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 19:55:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 19:55:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:55:20,834 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:20,834 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:55:20,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:55:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:20,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:20,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:20,835 INFO L427 AbstractCegarLoop]: === Iteration 1271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1846665153, now seen corresponding path program 1264 times [2020-02-10 19:55:20,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:20,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892178929] [2020-02-10 19:55:20,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:21,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892178929] [2020-02-10 19:55:21,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:21,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:21,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158576893] [2020-02-10 19:55:21,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:21,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:21,201 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:21,344 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 19:55:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:21,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:21,348 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 19:55:21,348 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:55:21,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:55:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 19:55:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:55:21,370 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:55:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:21,370 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:55:21,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:55:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:21,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:21,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:21,371 INFO L427 AbstractCegarLoop]: === Iteration 1272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash 216237861, now seen corresponding path program 1265 times [2020-02-10 19:55:21,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:21,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43769830] [2020-02-10 19:55:21,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:21,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 19:55:21,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43769830] [2020-02-10 19:55:21,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:21,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:21,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701514825] [2020-02-10 19:55:21,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:21,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:21,720 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:55:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:21,860 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-02-10 19:55:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:21,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:21,863 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:55:21,863 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:21,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:55:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:55:21,884 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:55:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:21,884 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:55:21,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:55:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:21,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:21,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:21,886 INFO L427 AbstractCegarLoop]: === Iteration 1273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash -856847519, now seen corresponding path program 1266 times [2020-02-10 19:55:21,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:21,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811290501] [2020-02-10 19:55:21,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:22,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811290501] [2020-02-10 19:55:22,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:22,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47437610] [2020-02-10 19:55:22,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:22,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:22,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:22,256 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:55:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:22,420 INFO L93 Difference]: Finished difference Result 1181 states and 4180 transitions. [2020-02-10 19:55:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:22,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:22,424 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:55:22,424 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:55:22,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:55:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 773. [2020-02-10 19:55:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:55:22,445 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:55:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:22,445 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:55:22,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:55:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:22,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:22,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:22,446 INFO L427 AbstractCegarLoop]: === Iteration 1274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1008586239, now seen corresponding path program 1267 times [2020-02-10 19:55:22,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:22,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840218461] [2020-02-10 19:55:22,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:22,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840218461] [2020-02-10 19:55:22,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:22,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231600819] [2020-02-10 19:55:22,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:22,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:22,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:22,795 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:55:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:22,927 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-02-10 19:55:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:22,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:22,930 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:55:22,931 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:22,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-02-10 19:55:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:55:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 19:55:22,952 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:22,952 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 19:55:22,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 19:55:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:22,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:22,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:22,953 INFO L427 AbstractCegarLoop]: === Iteration 1275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -64499141, now seen corresponding path program 1268 times [2020-02-10 19:55:22,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:22,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748586440] [2020-02-10 19:55:22,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:23,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748586440] [2020-02-10 19:55:23,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:23,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:23,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260662133] [2020-02-10 19:55:23,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:23,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:23,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:23,301 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,446 INFO L93 Difference]: Finished difference Result 1184 states and 4187 transitions. [2020-02-10 19:55:23,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:23,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,449 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:55:23,449 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 19:55:23,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 19:55:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 19:55:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:55:23,470 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:55:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,470 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:55:23,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:55:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:23,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:23,472 INFO L427 AbstractCegarLoop]: === Iteration 1276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2102677827, now seen corresponding path program 1269 times [2020-02-10 19:55:23,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290468249] [2020-02-10 19:55:23,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:23,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290468249] [2020-02-10 19:55:23,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:23,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:23,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217008114] [2020-02-10 19:55:23,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:23,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:23,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:23,823 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:55:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,946 INFO L93 Difference]: Finished difference Result 1178 states and 4175 transitions. [2020-02-10 19:55:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:23,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,950 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 19:55:23,950 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 19:55:23,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 19:55:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 19:55:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:55:23,971 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:55:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,971 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:55:23,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:55:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:23,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:23,973 INFO L427 AbstractCegarLoop]: === Iteration 1277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash -43492933, now seen corresponding path program 1270 times [2020-02-10 19:55:23,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247564043] [2020-02-10 19:55:23,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:24,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247564043] [2020-02-10 19:55:24,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:24,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:24,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931688164] [2020-02-10 19:55:24,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:24,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:24,324 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:55:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:24,459 INFO L93 Difference]: Finished difference Result 1177 states and 4171 transitions. [2020-02-10 19:55:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:24,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:24,462 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 19:55:24,463 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 19:55:24,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 19:55:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 19:55:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:55:24,484 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:55:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:24,484 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:55:24,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:55:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:24,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:24,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:24,486 INFO L427 AbstractCegarLoop]: === Iteration 1278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:24,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2123684035, now seen corresponding path program 1271 times [2020-02-10 19:55:24,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:24,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305410401] [2020-02-10 19:55:24,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:24,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 19:55:24,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305410401] [2020-02-10 19:55:24,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:24,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:24,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271476241] [2020-02-10 19:55:24,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:24,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:24,842 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:55:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:24,965 INFO L93 Difference]: Finished difference Result 1182 states and 4181 transitions. [2020-02-10 19:55:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:24,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:24,969 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:55:24,969 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:24,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 19:55:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:55:24,990 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:55:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:24,990 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:55:24,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:55:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:24,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:24,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:24,991 INFO L427 AbstractCegarLoop]: === Iteration 1279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:24,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1050598655, now seen corresponding path program 1272 times [2020-02-10 19:55:24,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:24,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210046088] [2020-02-10 19:55:24,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:25,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 19:55:25,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210046088] [2020-02-10 19:55:25,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:25,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:25,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586233257] [2020-02-10 19:55:25,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:25,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:25,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:25,341 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:55:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:25,485 INFO L93 Difference]: Finished difference Result 1179 states and 4173 transitions. [2020-02-10 19:55:25,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:25,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:25,489 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 19:55:25,489 INFO L226 Difference]: Without dead ends: 1162 [2020-02-10 19:55:25,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-02-10 19:55:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 771. [2020-02-10 19:55:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:55:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 19:55:25,510 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 19:55:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:25,510 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 19:55:25,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 19:55:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:25,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:25,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:25,511 INFO L427 AbstractCegarLoop]: === Iteration 1280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 997701631, now seen corresponding path program 1273 times [2020-02-10 19:55:25,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:25,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938190166] [2020-02-10 19:55:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:25,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938190166] [2020-02-10 19:55:25,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:25,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:25,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677395696] [2020-02-10 19:55:25,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:25,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:25,834 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 19:55:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:25,977 INFO L93 Difference]: Finished difference Result 1209 states and 4260 transitions. [2020-02-10 19:55:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:25,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:25,981 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 19:55:25,981 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:55:25,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:55:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 781. [2020-02-10 19:55:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:55:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-02-10 19:55:26,003 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-02-10 19:55:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:26,003 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-02-10 19:55:26,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-02-10 19:55:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:26,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:26,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:26,004 INFO L427 AbstractCegarLoop]: === Iteration 1281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1988959453, now seen corresponding path program 1274 times [2020-02-10 19:55:26,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:26,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595919843] [2020-02-10 19:55:26,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:26,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595919843] [2020-02-10 19:55:26,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:26,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:26,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377401924] [2020-02-10 19:55:26,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:26,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:26,334 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:55:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:26,461 INFO L93 Difference]: Finished difference Result 1212 states and 4262 transitions. [2020-02-10 19:55:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:26,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:26,464 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:55:26,464 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:55:26,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:55:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-02-10 19:55:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 19:55:26,485 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 19:55:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:26,485 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 19:55:26,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 19:55:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:26,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:26,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:26,486 INFO L427 AbstractCegarLoop]: === Iteration 1282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1371231587, now seen corresponding path program 1275 times [2020-02-10 19:55:26,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:26,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707655620] [2020-02-10 19:55:26,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:26,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707655620] [2020-02-10 19:55:26,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:26,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:26,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176005113] [2020-02-10 19:55:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:26,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:26,825 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:55:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:26,950 INFO L93 Difference]: Finished difference Result 1207 states and 4252 transitions. [2020-02-10 19:55:26,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:26,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:26,953 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:55:26,954 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 19:55:26,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 19:55:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 19:55:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:55:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 19:55:26,975 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 19:55:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:26,975 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 19:55:26,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 19:55:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:26,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:26,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:26,977 INFO L427 AbstractCegarLoop]: === Iteration 1283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash -369470661, now seen corresponding path program 1276 times [2020-02-10 19:55:26,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:26,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213192580] [2020-02-10 19:55:26,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:27,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213192580] [2020-02-10 19:55:27,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:27,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:27,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014295181] [2020-02-10 19:55:27,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:27,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:27,312 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:55:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:27,437 INFO L93 Difference]: Finished difference Result 1208 states and 4250 transitions. [2020-02-10 19:55:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:27,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:27,440 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:55:27,440 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:55:27,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:55:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:55:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-02-10 19:55:27,461 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-02-10 19:55:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:27,462 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-02-10 19:55:27,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-02-10 19:55:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:27,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:27,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:27,463 INFO L427 AbstractCegarLoop]: === Iteration 1284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1316190209, now seen corresponding path program 1277 times [2020-02-10 19:55:27,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:27,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478261041] [2020-02-10 19:55:27,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:27,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478261041] [2020-02-10 19:55:27,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:27,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:27,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714279660] [2020-02-10 19:55:27,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:27,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:27,806 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:55:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:27,926 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 19:55:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:27,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:27,930 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:55:27,930 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:55:27,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:55:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 19:55:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:55:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-02-10 19:55:27,951 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-02-10 19:55:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:27,951 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-02-10 19:55:27,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-02-10 19:55:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:27,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:27,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:27,952 INFO L427 AbstractCegarLoop]: === Iteration 1285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash 294750749, now seen corresponding path program 1278 times [2020-02-10 19:55:27,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:27,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695863642] [2020-02-10 19:55:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:28,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695863642] [2020-02-10 19:55:28,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:28,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:28,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452982535] [2020-02-10 19:55:28,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:28,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:28,278 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:55:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:28,430 INFO L93 Difference]: Finished difference Result 1212 states and 4254 transitions. [2020-02-10 19:55:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:28,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:28,433 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:55:28,433 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:55:28,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:55:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-02-10 19:55:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:55:28,454 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:55:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,454 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:55:28,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:55:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:28,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,455 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:28,455 INFO L427 AbstractCegarLoop]: === Iteration 1286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 152730179, now seen corresponding path program 1279 times [2020-02-10 19:55:28,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639083760] [2020-02-10 19:55:28,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:28,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639083760] [2020-02-10 19:55:28,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:28,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:28,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77811730] [2020-02-10 19:55:28,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:28,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:28,779 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:55:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:28,911 INFO L93 Difference]: Finished difference Result 1199 states and 4229 transitions. [2020-02-10 19:55:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:28,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:28,915 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 19:55:28,915 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:55:28,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:55:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-02-10 19:55:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:55:28,936 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,936 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:55:28,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:55:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:28,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:28,937 INFO L427 AbstractCegarLoop]: === Iteration 1287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1143988001, now seen corresponding path program 1280 times [2020-02-10 19:55:28,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019758657] [2020-02-10 19:55:28,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:29,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 19:55:29,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019758657] [2020-02-10 19:55:29,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:29,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:29,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462402812] [2020-02-10 19:55:29,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:29,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:29,261 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:29,388 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-02-10 19:55:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:29,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:29,391 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:55:29,392 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:29,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-02-10 19:55:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:55:29,413 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:29,413 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:55:29,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:55:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:29,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:29,414 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:29,414 INFO L427 AbstractCegarLoop]: === Iteration 1288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1635865117, now seen corresponding path program 1281 times [2020-02-10 19:55:29,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:29,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476984851] [2020-02-10 19:55:29,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:29,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476984851] [2020-02-10 19:55:29,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:29,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:29,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657419961] [2020-02-10 19:55:29,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:29,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:29,739 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:29,876 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-02-10 19:55:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:29,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:29,879 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:29,879 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:55:29,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:55:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 19:55:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:55:29,899 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:29,899 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:55:29,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:55:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:29,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:29,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:29,901 INFO L427 AbstractCegarLoop]: === Iteration 1289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:29,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1636335045, now seen corresponding path program 1282 times [2020-02-10 19:55:29,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:29,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262044779] [2020-02-10 19:55:29,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:30,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262044779] [2020-02-10 19:55:30,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:30,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078937848] [2020-02-10 19:55:30,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:30,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:30,220 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:30,348 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 19:55:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:30,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:30,351 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:55:30,351 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:55:30,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:55:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 19:55:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:55:30,372 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:55:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:30,372 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:55:30,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:55:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:30,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:30,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] [2020-02-10 19:55:30,373 INFO L427 AbstractCegarLoop]: === Iteration 1290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1509969213, now seen corresponding path program 1283 times [2020-02-10 19:55:30,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:30,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412464143] [2020-02-10 19:55:30,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:30,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412464143] [2020-02-10 19:55:30,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:30,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199032892] [2020-02-10 19:55:30,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:30,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:30,706 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:55:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:30,830 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-02-10 19:55:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:30,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:30,834 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:55:30,834 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:30,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 19:55:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:55:30,855 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:55:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:30,855 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:55:30,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:55:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:30,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:30,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:30,857 INFO L427 AbstractCegarLoop]: === Iteration 1291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash -972113635, now seen corresponding path program 1284 times [2020-02-10 19:55:30,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:30,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731268483] [2020-02-10 19:55:30,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731268483] [2020-02-10 19:55:31,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:31,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:31,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550797687] [2020-02-10 19:55:31,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:31,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:31,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:31,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:31,175 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:55:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:31,317 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-02-10 19:55:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:31,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:31,320 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:55:31,320 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:31,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 19:55:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:55:31,341 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:55:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:31,341 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:55:31,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:55:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:31,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:31,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:31,342 INFO L427 AbstractCegarLoop]: === Iteration 1292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1656278531, now seen corresponding path program 1285 times [2020-02-10 19:55:31,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:31,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398394561] [2020-02-10 19:55:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:31,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398394561] [2020-02-10 19:55:31,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:31,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:31,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586763562] [2020-02-10 19:55:31,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:31,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:31,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:31,679 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:55:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:31,824 INFO L93 Difference]: Finished difference Result 1195 states and 4219 transitions. [2020-02-10 19:55:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:31,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:31,828 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:55:31,828 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:31,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 19:55:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3094 transitions. [2020-02-10 19:55:31,848 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3094 transitions. Word has length 25 [2020-02-10 19:55:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:31,848 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3094 transitions. [2020-02-10 19:55:31,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3094 transitions. [2020-02-10 19:55:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:31,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:31,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:31,850 INFO L427 AbstractCegarLoop]: === Iteration 1293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:31,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1636927839, now seen corresponding path program 1286 times [2020-02-10 19:55:31,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:31,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221474316] [2020-02-10 19:55:31,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:32,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221474316] [2020-02-10 19:55:32,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:32,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:32,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354086725] [2020-02-10 19:55:32,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:32,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:32,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:32,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:32,184 INFO L87 Difference]: Start difference. First operand 779 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:55:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:32,306 INFO L93 Difference]: Finished difference Result 1196 states and 4217 transitions. [2020-02-10 19:55:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:32,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:32,310 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:55:32,310 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:32,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:55:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:55:32,331 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:55:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,331 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:55:32,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:55:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:32,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:32,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:32,333 INFO L427 AbstractCegarLoop]: === Iteration 1294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1213379391, now seen corresponding path program 1287 times [2020-02-10 19:55:32,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181022769] [2020-02-10 19:55:32,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:32,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181022769] [2020-02-10 19:55:32,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:32,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:32,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184983061] [2020-02-10 19:55:32,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:32,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:32,657 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:55:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:32,785 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 19:55:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:32,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:32,788 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:55:32,789 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:55:32,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:55:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 777. [2020-02-10 19:55:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:55:32,811 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:55:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,811 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:55:32,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:55:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:32,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:32,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:32,812 INFO L427 AbstractCegarLoop]: === Iteration 1295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2058820771, now seen corresponding path program 1288 times [2020-02-10 19:55:32,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677773313] [2020-02-10 19:55:32,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:33,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677773313] [2020-02-10 19:55:33,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:33,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:33,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736857881] [2020-02-10 19:55:33,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:33,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:33,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:33,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:33,141 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:55:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:33,273 INFO L93 Difference]: Finished difference Result 1188 states and 4199 transitions. [2020-02-10 19:55:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:33,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:33,277 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:55:33,277 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:55:33,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:55:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 19:55:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:55:33,297 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:55:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:33,298 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:55:33,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:55:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:33,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:33,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:33,299 INFO L427 AbstractCegarLoop]: === Iteration 1296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 4082243, now seen corresponding path program 1289 times [2020-02-10 19:55:33,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:33,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237558722] [2020-02-10 19:55:33,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:33,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 19:55:33,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237558722] [2020-02-10 19:55:33,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:33,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:33,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204342199] [2020-02-10 19:55:33,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:33,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:33,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:33,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:33,632 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:55:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:33,753 INFO L93 Difference]: Finished difference Result 1192 states and 4207 transitions. [2020-02-10 19:55:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:33,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:33,756 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:33,756 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:33,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 19:55:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:55:33,777 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:55:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:33,777 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:55:33,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:55:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:33,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:33,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:33,778 INFO L427 AbstractCegarLoop]: === Iteration 1297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1069003137, now seen corresponding path program 1290 times [2020-02-10 19:55:33,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:33,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158065334] [2020-02-10 19:55:33,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:34,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158065334] [2020-02-10 19:55:34,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:34,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056023868] [2020-02-10 19:55:34,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:34,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:34,109 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:55:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:34,240 INFO L93 Difference]: Finished difference Result 1189 states and 4199 transitions. [2020-02-10 19:55:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:34,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:34,243 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:55:34,244 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:55:34,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:55:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 19:55:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 19:55:34,265 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 19:55:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:34,265 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 19:55:34,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 19:55:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:34,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:34,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:34,266 INFO L427 AbstractCegarLoop]: === Iteration 1298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1984485219, now seen corresponding path program 1291 times [2020-02-10 19:55:34,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:34,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577592972] [2020-02-10 19:55:34,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:34,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577592972] [2020-02-10 19:55:34,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:34,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440002918] [2020-02-10 19:55:34,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:34,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:34,584 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 19:55:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:34,706 INFO L93 Difference]: Finished difference Result 1206 states and 4241 transitions. [2020-02-10 19:55:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:34,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:34,710 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:55:34,710 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:55:34,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:55:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 19:55:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-02-10 19:55:34,732 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-02-10 19:55:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:34,732 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-02-10 19:55:34,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-02-10 19:55:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:34,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:34,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:34,733 INFO L427 AbstractCegarLoop]: === Iteration 1299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -373544261, now seen corresponding path program 1292 times [2020-02-10 19:55:34,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:34,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214510344] [2020-02-10 19:55:34,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:35,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214510344] [2020-02-10 19:55:35,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:35,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:35,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138608945] [2020-02-10 19:55:35,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:35,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:35,046 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:55:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,199 INFO L93 Difference]: Finished difference Result 1204 states and 4232 transitions. [2020-02-10 19:55:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:35,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,202 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:55:35,202 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 19:55:35,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 19:55:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 775. [2020-02-10 19:55:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:55:35,223 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:55:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,224 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:55:35,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:55:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:35,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:35,225 INFO L427 AbstractCegarLoop]: === Iteration 1300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash -890393631, now seen corresponding path program 1293 times [2020-02-10 19:55:35,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979114444] [2020-02-10 19:55:35,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:35,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 19:55:35,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979114444] [2020-02-10 19:55:35,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:35,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:35,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490346396] [2020-02-10 19:55:35,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:35,527 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:55:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,669 INFO L93 Difference]: Finished difference Result 1200 states and 4224 transitions. [2020-02-10 19:55:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:35,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,673 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:55:35,673 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:55:35,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:55:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 19:55:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:55:35,694 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:55:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,694 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:55:35,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:55:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:35,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:35,695 INFO L427 AbstractCegarLoop]: === Iteration 1301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -352538053, now seen corresponding path program 1294 times [2020-02-10 19:55:35,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36960305] [2020-02-10 19:55:35,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:36,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36960305] [2020-02-10 19:55:36,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:36,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092842069] [2020-02-10 19:55:36,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:36,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:36,007 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:55:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:36,139 INFO L93 Difference]: Finished difference Result 1195 states and 4212 transitions. [2020-02-10 19:55:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:36,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:36,142 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:55:36,142 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:36,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-02-10 19:55:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 19:55:36,163 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 19:55:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:36,163 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 19:55:36,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 19:55:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:36,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:36,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] [2020-02-10 19:55:36,164 INFO L427 AbstractCegarLoop]: === Iteration 1302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash -879890527, now seen corresponding path program 1295 times [2020-02-10 19:55:36,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:36,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277259293] [2020-02-10 19:55:36,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:36,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277259293] [2020-02-10 19:55:36,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:36,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095685801] [2020-02-10 19:55:36,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:36,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:36,498 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:55:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:36,642 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-02-10 19:55:36,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:36,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:36,645 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:55:36,645 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:36,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 19:55:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 19:55:36,668 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 19:55:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:36,668 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 19:55:36,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 19:55:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:36,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:36,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:36,669 INFO L427 AbstractCegarLoop]: === Iteration 1303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1952975907, now seen corresponding path program 1296 times [2020-02-10 19:55:36,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:36,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796267859] [2020-02-10 19:55:36,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:36,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796267859] [2020-02-10 19:55:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:36,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687112147] [2020-02-10 19:55:36,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:36,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:36,985 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:55:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:37,119 INFO L93 Difference]: Finished difference Result 1193 states and 4206 transitions. [2020-02-10 19:55:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:37,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:37,123 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:55:37,123 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:37,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 771. [2020-02-10 19:55:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:55:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3073 transitions. [2020-02-10 19:55:37,144 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3073 transitions. Word has length 25 [2020-02-10 19:55:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:37,144 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3073 transitions. [2020-02-10 19:55:37,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3073 transitions. [2020-02-10 19:55:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:37,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:37,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:37,145 INFO L427 AbstractCegarLoop]: === Iteration 1304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash -507462939, now seen corresponding path program 1297 times [2020-02-10 19:55:37,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:37,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11534520] [2020-02-10 19:55:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:37,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11534520] [2020-02-10 19:55:37,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:37,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:37,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112349496] [2020-02-10 19:55:37,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:37,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:37,457 INFO L87 Difference]: Start difference. First operand 771 states and 3073 transitions. Second operand 10 states. [2020-02-10 19:55:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:37,578 INFO L93 Difference]: Finished difference Result 1198 states and 4227 transitions. [2020-02-10 19:55:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:37,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:37,581 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:55:37,581 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:55:37,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:55:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-02-10 19:55:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 19:55:37,603 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 19:55:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:37,603 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 19:55:37,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 19:55:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:37,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:37,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] [2020-02-10 19:55:37,604 INFO L427 AbstractCegarLoop]: === Iteration 1305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:37,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1103478019, now seen corresponding path program 1298 times [2020-02-10 19:55:37,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:37,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558269863] [2020-02-10 19:55:37,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:37,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 19:55:37,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558269863] [2020-02-10 19:55:37,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:37,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:37,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038867177] [2020-02-10 19:55:37,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:37,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:37,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:37,917 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:55:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,041 INFO L93 Difference]: Finished difference Result 1202 states and 4232 transitions. [2020-02-10 19:55:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:38,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:38,044 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:55:38,044 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 19:55:38,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 19:55:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 776. [2020-02-10 19:55:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:55:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3090 transitions. [2020-02-10 19:55:38,066 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:38,066 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3090 transitions. [2020-02-10 19:55:38,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3090 transitions. [2020-02-10 19:55:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:38,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:38,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:38,067 INFO L427 AbstractCegarLoop]: === Iteration 1306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2107900793, now seen corresponding path program 1299 times [2020-02-10 19:55:38,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:38,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860378278] [2020-02-10 19:55:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:38,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860378278] [2020-02-10 19:55:38,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:38,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:38,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994516770] [2020-02-10 19:55:38,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:38,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:38,390 INFO L87 Difference]: Start difference. First operand 776 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,516 INFO L93 Difference]: Finished difference Result 1196 states and 4220 transitions. [2020-02-10 19:55:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:38,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:38,520 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:55:38,520 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:55:38,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:55:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-02-10 19:55:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3095 transitions. [2020-02-10 19:55:38,541 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3095 transitions. Word has length 25 [2020-02-10 19:55:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:38,542 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3095 transitions. [2020-02-10 19:55:38,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3095 transitions. [2020-02-10 19:55:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:38,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:38,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:38,543 INFO L427 AbstractCegarLoop]: === Iteration 1307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1113981123, now seen corresponding path program 1300 times [2020-02-10 19:55:38,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:38,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158915230] [2020-02-10 19:55:38,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:38,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158915230] [2020-02-10 19:55:38,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:38,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:38,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85096264] [2020-02-10 19:55:38,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:38,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:38,864 INFO L87 Difference]: Start difference. First operand 779 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:55:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,999 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-02-10 19:55:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:38,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,002 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:55:39,002 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:55:39,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:55:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-02-10 19:55:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:55:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3087 transitions. [2020-02-10 19:55:39,024 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,024 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3087 transitions. [2020-02-10 19:55:39,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3087 transitions. [2020-02-10 19:55:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:39,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:39,025 INFO L427 AbstractCegarLoop]: === Iteration 1308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2097397689, now seen corresponding path program 1301 times [2020-02-10 19:55:39,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012169583] [2020-02-10 19:55:39,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:39,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012169583] [2020-02-10 19:55:39,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:39,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952862081] [2020-02-10 19:55:39,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:39,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:39,359 INFO L87 Difference]: Start difference. First operand 776 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,482 INFO L93 Difference]: Finished difference Result 1206 states and 4239 transitions. [2020-02-10 19:55:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:39,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,485 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:55:39,485 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:55:39,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:55:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 781. [2020-02-10 19:55:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:55:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3096 transitions. [2020-02-10 19:55:39,506 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,506 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3096 transitions. [2020-02-10 19:55:39,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3096 transitions. [2020-02-10 19:55:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:39,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,508 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:39,508 INFO L427 AbstractCegarLoop]: === Iteration 1309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash -486456731, now seen corresponding path program 1302 times [2020-02-10 19:55:39,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173231365] [2020-02-10 19:55:39,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:39,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 19:55:39,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173231365] [2020-02-10 19:55:39,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:39,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609178754] [2020-02-10 19:55:39,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:39,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:39,832 INFO L87 Difference]: Start difference. First operand 781 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,966 INFO L93 Difference]: Finished difference Result 1204 states and 4230 transitions. [2020-02-10 19:55:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:39,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,970 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:55:39,970 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:55:39,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:55:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 19:55:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:55:39,991 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:55:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,992 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:55:39,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:55:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:39,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:39,993 INFO L427 AbstractCegarLoop]: === Iteration 1310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -950362079, now seen corresponding path program 1303 times [2020-02-10 19:55:39,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675060984] [2020-02-10 19:55:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:40,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 19:55:40,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675060984] [2020-02-10 19:55:40,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:40,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:40,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160593822] [2020-02-10 19:55:40,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:40,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:40,307 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:55:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:40,458 INFO L93 Difference]: Finished difference Result 1190 states and 4203 transitions. [2020-02-10 19:55:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:40,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:40,461 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:55:40,461 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:40,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-02-10 19:55:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:55:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 19:55:40,482 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:40,483 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 19:55:40,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 19:55:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:40,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:40,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:40,484 INFO L427 AbstractCegarLoop]: === Iteration 1311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash 660578879, now seen corresponding path program 1304 times [2020-02-10 19:55:40,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:40,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767425566] [2020-02-10 19:55:40,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:40,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767425566] [2020-02-10 19:55:40,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:40,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:40,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197510245] [2020-02-10 19:55:40,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:40,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:40,796 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:40,929 INFO L93 Difference]: Finished difference Result 1194 states and 4208 transitions. [2020-02-10 19:55:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:40,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:40,933 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:55:40,933 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:55:40,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:55:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 19:55:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:55:40,954 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:55:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:40,954 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:55:40,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:55:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:40,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:40,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:40,956 INFO L427 AbstractCegarLoop]: === Iteration 1312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1456708345, now seen corresponding path program 1305 times [2020-02-10 19:55:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:40,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858286276] [2020-02-10 19:55:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858286276] [2020-02-10 19:55:41,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:41,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:41,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286441979] [2020-02-10 19:55:41,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:41,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:41,289 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:55:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:41,426 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-02-10 19:55:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:41,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:41,429 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 19:55:41,430 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:55:41,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:55:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 19:55:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:55:41,451 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:55:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:41,451 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:55:41,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:55:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:41,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:41,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:41,452 INFO L427 AbstractCegarLoop]: === Iteration 1313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash 692088191, now seen corresponding path program 1306 times [2020-02-10 19:55:41,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:41,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128459198] [2020-02-10 19:55:41,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:41,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128459198] [2020-02-10 19:55:41,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:41,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:41,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580157501] [2020-02-10 19:55:41,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:41,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:41,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:41,784 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:55:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:41,915 INFO L93 Difference]: Finished difference Result 1183 states and 4184 transitions. [2020-02-10 19:55:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:41,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:41,918 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:55:41,918 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:41,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 19:55:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:55:41,939 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:55:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:41,939 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:55:41,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:55:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:41,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:41,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:41,940 INFO L427 AbstractCegarLoop]: === Iteration 1314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1446205241, now seen corresponding path program 1307 times [2020-02-10 19:55:41,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:41,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446871307] [2020-02-10 19:55:41,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:42,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446871307] [2020-02-10 19:55:42,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:42,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:42,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011662351] [2020-02-10 19:55:42,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:42,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:42,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:42,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:42,269 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:55:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:42,407 INFO L93 Difference]: Finished difference Result 1192 states and 4202 transitions. [2020-02-10 19:55:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:42,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:42,411 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:42,411 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:55:42,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:55:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:55:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:55:42,433 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:55:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:42,433 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:55:42,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:55:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:42,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:42,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:42,434 INFO L427 AbstractCegarLoop]: === Iteration 1315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -908349663, now seen corresponding path program 1308 times [2020-02-10 19:55:42,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:42,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783717949] [2020-02-10 19:55:42,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:42,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783717949] [2020-02-10 19:55:42,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:42,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:42,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928109663] [2020-02-10 19:55:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:42,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:42,745 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:55:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:42,880 INFO L93 Difference]: Finished difference Result 1187 states and 4190 transitions. [2020-02-10 19:55:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:42,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:42,883 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:55:42,883 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:55:42,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:55:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 19:55:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 19:55:42,905 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 19:55:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:42,905 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 19:55:42,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 19:55:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:42,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:42,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:42,906 INFO L427 AbstractCegarLoop]: === Iteration 1316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash -624765855, now seen corresponding path program 1309 times [2020-02-10 19:55:42,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:42,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136506402] [2020-02-10 19:55:42,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:43,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136506402] [2020-02-10 19:55:43,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:43,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012449381] [2020-02-10 19:55:43,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:43,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:43,239 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 19:55:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:43,394 INFO L93 Difference]: Finished difference Result 1186 states and 4193 transitions. [2020-02-10 19:55:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:43,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:43,397 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:55:43,397 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 19:55:43,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 19:55:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-02-10 19:55:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:55:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3090 transitions. [2020-02-10 19:55:43,419 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:43,419 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3090 transitions. [2020-02-10 19:55:43,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3090 transitions. [2020-02-10 19:55:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:43,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:43,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:43,420 INFO L427 AbstractCegarLoop]: === Iteration 1317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:43,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1697851235, now seen corresponding path program 1310 times [2020-02-10 19:55:43,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:43,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935214372] [2020-02-10 19:55:43,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:43,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935214372] [2020-02-10 19:55:43,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:43,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:43,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279718668] [2020-02-10 19:55:43,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:43,746 INFO L87 Difference]: Start difference. First operand 778 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:43,882 INFO L93 Difference]: Finished difference Result 1188 states and 4194 transitions. [2020-02-10 19:55:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:43,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:43,885 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:55:43,886 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:55:43,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:55:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 19:55:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:55:43,907 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:55:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:43,907 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:55:43,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:55:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:43,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:43,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] [2020-02-10 19:55:43,908 INFO L427 AbstractCegarLoop]: === Iteration 1318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:43,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash 469325733, now seen corresponding path program 1311 times [2020-02-10 19:55:43,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:43,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937701632] [2020-02-10 19:55:43,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:44,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 19:55:44,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937701632] [2020-02-10 19:55:44,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:44,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:44,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368140305] [2020-02-10 19:55:44,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:44,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:44,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:44,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:44,238 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:55:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,394 INFO L93 Difference]: Finished difference Result 1182 states and 4182 transitions. [2020-02-10 19:55:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:44,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,397 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 19:55:44,398 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:44,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 19:55:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:55:44,418 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:55:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,418 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:55:44,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:55:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:44,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:44,420 INFO L427 AbstractCegarLoop]: === Iteration 1319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1676845027, now seen corresponding path program 1312 times [2020-02-10 19:55:44,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901786530] [2020-02-10 19:55:44,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:44,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901786530] [2020-02-10 19:55:44,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:44,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:44,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649726728] [2020-02-10 19:55:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:44,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:44,754 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:55:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,909 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-02-10 19:55:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:44,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,912 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 19:55:44,912 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:44,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 19:55:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 19:55:44,934 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 19:55:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,934 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 19:55:44,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 19:55:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:44,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:44,935 INFO L427 AbstractCegarLoop]: === Iteration 1320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 490331941, now seen corresponding path program 1313 times [2020-02-10 19:55:44,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220915737] [2020-02-10 19:55:44,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:45,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 19:55:45,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220915737] [2020-02-10 19:55:45,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:45,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:45,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337385080] [2020-02-10 19:55:45,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:45,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:45,273 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:55:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:45,406 INFO L93 Difference]: Finished difference Result 1186 states and 4188 transitions. [2020-02-10 19:55:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:45,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:45,409 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:55:45,409 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:55:45,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:55:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 19:55:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 19:55:45,430 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 19:55:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:45,430 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 19:55:45,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 19:55:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:45,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:45,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:45,431 INFO L427 AbstractCegarLoop]: === Iteration 1321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash -582753439, now seen corresponding path program 1314 times [2020-02-10 19:55:45,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:45,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454905187] [2020-02-10 19:55:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:45,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454905187] [2020-02-10 19:55:45,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:45,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:45,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36158410] [2020-02-10 19:55:45,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:45,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:45,754 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:55:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:45,896 INFO L93 Difference]: Finished difference Result 1183 states and 4180 transitions. [2020-02-10 19:55:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:45,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:45,900 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 19:55:45,900 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 19:55:45,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 19:55:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-02-10 19:55:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:55:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3076 transitions. [2020-02-10 19:55:45,921 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3076 transitions. Word has length 25 [2020-02-10 19:55:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:45,922 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3076 transitions. [2020-02-10 19:55:45,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3076 transitions. [2020-02-10 19:55:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:45,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:45,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:45,923 INFO L427 AbstractCegarLoop]: === Iteration 1322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1311771327, now seen corresponding path program 1315 times [2020-02-10 19:55:45,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:45,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110562310] [2020-02-10 19:55:45,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:46,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110562310] [2020-02-10 19:55:46,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:46,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:46,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919646008] [2020-02-10 19:55:46,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:46,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:46,248 INFO L87 Difference]: Start difference. First operand 773 states and 3076 transitions. Second operand 10 states. [2020-02-10 19:55:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:46,382 INFO L93 Difference]: Finished difference Result 1202 states and 4227 transitions. [2020-02-10 19:55:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:46,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:46,385 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:55:46,385 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:55:46,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:55:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 19:55:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3092 transitions. [2020-02-10 19:55:46,406 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:46,406 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3092 transitions. [2020-02-10 19:55:46,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3092 transitions. [2020-02-10 19:55:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:46,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:46,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:46,408 INFO L427 AbstractCegarLoop]: === Iteration 1323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1372255011, now seen corresponding path program 1316 times [2020-02-10 19:55:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:46,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179578319] [2020-02-10 19:55:46,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:46,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179578319] [2020-02-10 19:55:46,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:46,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:46,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964124510] [2020-02-10 19:55:46,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:46,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:46,729 INFO L87 Difference]: Start difference. First operand 780 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:46,908 INFO L93 Difference]: Finished difference Result 1200 states and 4218 transitions. [2020-02-10 19:55:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:46,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:46,912 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:55:46,912 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:55:46,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:55:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 19:55:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 19:55:46,933 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 19:55:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:46,934 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 19:55:46,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 19:55:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:46,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:46,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:46,935 INFO L427 AbstractCegarLoop]: === Iteration 1324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1889104381, now seen corresponding path program 1317 times [2020-02-10 19:55:46,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:46,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960365895] [2020-02-10 19:55:46,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55: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 19:55:47,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960365895] [2020-02-10 19:55:47,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:47,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:47,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038349621] [2020-02-10 19:55:47,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:47,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:47,252 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:55:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:47,383 INFO L93 Difference]: Finished difference Result 1196 states and 4210 transitions. [2020-02-10 19:55:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:47,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:47,387 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:55:47,387 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:55:47,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:55:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 19:55:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 19:55:47,408 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 19:55:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:47,408 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 19:55:47,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 19:55:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:47,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:47,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:47,409 INFO L427 AbstractCegarLoop]: === Iteration 1325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1351248803, now seen corresponding path program 1318 times [2020-02-10 19:55:47,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:47,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780892048] [2020-02-10 19:55:47,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:47,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 19:55:47,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780892048] [2020-02-10 19:55:47,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:47,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:47,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881871368] [2020-02-10 19:55:47,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:47,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:47,729 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:55:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:47,866 INFO L93 Difference]: Finished difference Result 1191 states and 4198 transitions. [2020-02-10 19:55:47,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:47,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:47,870 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:55:47,870 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:47,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:55:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:55:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3079 transitions. [2020-02-10 19:55:47,891 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3079 transitions. Word has length 25 [2020-02-10 19:55:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:47,892 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3079 transitions. [2020-02-10 19:55:47,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3079 transitions. [2020-02-10 19:55:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:47,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:47,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] [2020-02-10 19:55:47,893 INFO L427 AbstractCegarLoop]: === Iteration 1326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1878601277, now seen corresponding path program 1319 times [2020-02-10 19:55:47,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:47,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786020772] [2020-02-10 19:55:47,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:48,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 19:55:48,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786020772] [2020-02-10 19:55:48,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:48,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:48,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233580729] [2020-02-10 19:55:48,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:48,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:48,217 INFO L87 Difference]: Start difference. First operand 775 states and 3079 transitions. Second operand 10 states. [2020-02-10 19:55:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:48,367 INFO L93 Difference]: Finished difference Result 1192 states and 4200 transitions. [2020-02-10 19:55:48,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:48,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:48,371 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:55:48,371 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:55:48,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:55:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 19:55:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3082 transitions. [2020-02-10 19:55:48,392 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3082 transitions. Word has length 25 [2020-02-10 19:55:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,392 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3082 transitions. [2020-02-10 19:55:48,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3082 transitions. [2020-02-10 19:55:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:48,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:48,394 INFO L427 AbstractCegarLoop]: === Iteration 1327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1343280639, now seen corresponding path program 1320 times [2020-02-10 19:55:48,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605812813] [2020-02-10 19:55:48,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:48,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605812813] [2020-02-10 19:55:48,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:48,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:48,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263118066] [2020-02-10 19:55:48,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:48,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:48,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:48,716 INFO L87 Difference]: Start difference. First operand 777 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:55:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:48,858 INFO L93 Difference]: Finished difference Result 1189 states and 4192 transitions. [2020-02-10 19:55:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:48,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:48,862 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 19:55:48,862 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 19:55:48,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 19:55:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 769. [2020-02-10 19:55:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 19:55:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3068 transitions. [2020-02-10 19:55:48,883 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3068 transitions. Word has length 25 [2020-02-10 19:55:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,883 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3068 transitions. [2020-02-10 19:55:48,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3068 transitions. [2020-02-10 19:55:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:48,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:48,884 INFO L427 AbstractCegarLoop]: === Iteration 1328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash -984451491, now seen corresponding path program 1321 times [2020-02-10 19:55:48,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759504739] [2020-02-10 19:55:48,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:49,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 19:55:49,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759504739] [2020-02-10 19:55:49,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:49,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:49,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132588347] [2020-02-10 19:55:49,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:49,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:49,225 INFO L87 Difference]: Start difference. First operand 769 states and 3068 transitions. Second operand 10 states. [2020-02-10 19:55:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:49,373 INFO L93 Difference]: Finished difference Result 1226 states and 4316 transitions. [2020-02-10 19:55:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:49,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:49,376 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:55:49,376 INFO L226 Difference]: Without dead ends: 1211 [2020-02-10 19:55:49,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2020-02-10 19:55:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 780. [2020-02-10 19:55:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 19:55:49,397 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 19:55:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:49,397 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 19:55:49,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 19:55:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:49,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:49,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:49,399 INFO L427 AbstractCegarLoop]: === Iteration 1329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash 626489467, now seen corresponding path program 1322 times [2020-02-10 19:55:49,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:49,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454659723] [2020-02-10 19:55:49,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:49,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454659723] [2020-02-10 19:55:49,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:49,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:49,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377970753] [2020-02-10 19:55:49,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:49,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:49,740 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 19:55:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:49,876 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-02-10 19:55:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:49,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:49,879 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 19:55:49,880 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:55:49,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:55:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 777. [2020-02-10 19:55:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 19:55:49,901 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 19:55:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:49,901 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 19:55:49,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 19:55:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:49,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:49,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:49,902 INFO L427 AbstractCegarLoop]: === Iteration 1330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1710077951, now seen corresponding path program 1323 times [2020-02-10 19:55:49,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:49,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693019607] [2020-02-10 19:55:49,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:50,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693019607] [2020-02-10 19:55:50,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:50,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:50,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806665292] [2020-02-10 19:55:50,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:50,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:50,245 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:55:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:50,410 INFO L93 Difference]: Finished difference Result 1233 states and 4330 transitions. [2020-02-10 19:55:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:50,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:50,413 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:55:50,413 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:55:50,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:55:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-02-10 19:55:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:55:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 19:55:50,435 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 19:55:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:50,435 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 19:55:50,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 19:55:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:50,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:50,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:50,436 INFO L427 AbstractCegarLoop]: === Iteration 1331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:50,436 INFO L82 PathProgramCache]: Analyzing trace with hash 636992571, now seen corresponding path program 1324 times [2020-02-10 19:55:50,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:50,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813021326] [2020-02-10 19:55:50,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:50,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813021326] [2020-02-10 19:55:50,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:50,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:50,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990362339] [2020-02-10 19:55:50,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:50,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:50,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:50,784 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:55:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:50,918 INFO L93 Difference]: Finished difference Result 1234 states and 4326 transitions. [2020-02-10 19:55:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:50,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:50,922 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 19:55:50,922 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 19:55:50,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 19:55:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 777. [2020-02-10 19:55:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:55:50,944 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:55:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:50,944 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:55:50,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:55:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:50,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:50,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:50,945 INFO L427 AbstractCegarLoop]: === Iteration 1332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1720581055, now seen corresponding path program 1325 times [2020-02-10 19:55:50,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:50,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828461426] [2020-02-10 19:55:50,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:51,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828461426] [2020-02-10 19:55:51,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:51,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:51,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459064368] [2020-02-10 19:55:51,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:51,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:51,286 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:55:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:51,420 INFO L93 Difference]: Finished difference Result 1224 states and 4306 transitions. [2020-02-10 19:55:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:51,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:51,423 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 19:55:51,423 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 19:55:51,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 19:55:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 780. [2020-02-10 19:55:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 19:55:51,455 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 19:55:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:51,455 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 19:55:51,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 19:55:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:51,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:51,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:51,456 INFO L427 AbstractCegarLoop]: === Iteration 1333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -963445283, now seen corresponding path program 1326 times [2020-02-10 19:55:51,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:51,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80656504] [2020-02-10 19:55:51,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:51,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 19:55:51,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80656504] [2020-02-10 19:55:51,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:51,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:51,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403366207] [2020-02-10 19:55:51,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:51,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:51,800 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 19:55:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:51,922 INFO L93 Difference]: Finished difference Result 1228 states and 4311 transitions. [2020-02-10 19:55:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:51,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:51,925 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 19:55:51,925 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:55:51,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:55:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 774. [2020-02-10 19:55:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:55:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-02-10 19:55:51,946 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-02-10 19:55:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:51,947 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-02-10 19:55:51,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-02-10 19:55:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:51,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:51,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:51,948 INFO L427 AbstractCegarLoop]: === Iteration 1334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash 941582587, now seen corresponding path program 1327 times [2020-02-10 19:55:51,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:51,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010493402] [2020-02-10 19:55:51,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:52,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 19:55:52,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010493402] [2020-02-10 19:55:52,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:52,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:52,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291160666] [2020-02-10 19:55:52,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:52,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:52,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:52,293 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:55:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:52,422 INFO L93 Difference]: Finished difference Result 1223 states and 4306 transitions. [2020-02-10 19:55:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:52,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:52,425 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 19:55:52,425 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:55:52,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:55:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-02-10 19:55:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-02-10 19:55:52,447 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-02-10 19:55:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:52,447 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-02-10 19:55:52,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-02-10 19:55:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:52,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:52,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:52,448 INFO L427 AbstractCegarLoop]: === Iteration 1335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1742443751, now seen corresponding path program 1328 times [2020-02-10 19:55:52,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:52,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711920967] [2020-02-10 19:55:52,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:52,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711920967] [2020-02-10 19:55:52,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:52,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:52,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240009455] [2020-02-10 19:55:52,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:52,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:52,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:52,797 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-02-10 19:55:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:52,917 INFO L93 Difference]: Finished difference Result 1220 states and 4297 transitions. [2020-02-10 19:55:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:52,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:52,920 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:55:52,920 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 19:55:52,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 19:55:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-02-10 19:55:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 19:55:52,941 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 19:55:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:52,941 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 19:55:52,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 19:55:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:52,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:52,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:52,943 INFO L427 AbstractCegarLoop]: === Iteration 1336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:52,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:52,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2035674175, now seen corresponding path program 1329 times [2020-02-10 19:55:52,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:52,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828091073] [2020-02-10 19:55:52,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:53,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828091073] [2020-02-10 19:55:53,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:53,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:53,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473958271] [2020-02-10 19:55:53,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:53,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:53,299 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:55:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:53,414 INFO L93 Difference]: Finished difference Result 1227 states and 4313 transitions. [2020-02-10 19:55:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:53,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:53,417 INFO L225 Difference]: With dead ends: 1227 [2020-02-10 19:55:53,417 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 19:55:53,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 19:55:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-02-10 19:55:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:55:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 19:55:53,439 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 19:55:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:53,439 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 19:55:53,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 19:55:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:53,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:53,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:53,441 INFO L427 AbstractCegarLoop]: === Iteration 1337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:53,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1721437543, now seen corresponding path program 1330 times [2020-02-10 19:55:53,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:53,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040053172] [2020-02-10 19:55:53,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:53,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040053172] [2020-02-10 19:55:53,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:53,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:53,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926085075] [2020-02-10 19:55:53,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:53,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:53,786 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 19:55:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:53,916 INFO L93 Difference]: Finished difference Result 1226 states and 4306 transitions. [2020-02-10 19:55:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:53,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:53,919 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:55:53,919 INFO L226 Difference]: Without dead ends: 1207 [2020-02-10 19:55:53,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-02-10 19:55:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 777. [2020-02-10 19:55:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 19:55:53,940 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 19:55:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:53,940 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 19:55:53,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 19:55:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:53,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:53,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:53,942 INFO L427 AbstractCegarLoop]: === Iteration 1338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2046177279, now seen corresponding path program 1331 times [2020-02-10 19:55:53,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:53,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537413705] [2020-02-10 19:55:53,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:54,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537413705] [2020-02-10 19:55:54,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:54,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:54,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173732187] [2020-02-10 19:55:54,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:54,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:54,290 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 19:55:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:54,411 INFO L93 Difference]: Finished difference Result 1219 states and 4292 transitions. [2020-02-10 19:55:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:54,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:54,414 INFO L225 Difference]: With dead ends: 1219 [2020-02-10 19:55:54,414 INFO L226 Difference]: Without dead ends: 1207 [2020-02-10 19:55:54,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-02-10 19:55:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 780. [2020-02-10 19:55:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 19:55:54,435 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 19:55:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:54,435 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 19:55:54,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 19:55:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:54,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:54,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:54,436 INFO L427 AbstractCegarLoop]: === Iteration 1339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash 973091899, now seen corresponding path program 1332 times [2020-02-10 19:55:54,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:54,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929846814] [2020-02-10 19:55:54,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:54,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929846814] [2020-02-10 19:55:54,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:54,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:54,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339386372] [2020-02-10 19:55:54,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:54,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:54,796 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:55:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:54,923 INFO L93 Difference]: Finished difference Result 1221 states and 4293 transitions. [2020-02-10 19:55:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:54,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:54,926 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 19:55:54,926 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 19:55:54,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 19:55:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 774. [2020-02-10 19:55:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:55:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3087 transitions. [2020-02-10 19:55:54,947 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3087 transitions. Word has length 25 [2020-02-10 19:55:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:54,948 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3087 transitions. [2020-02-10 19:55:54,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3087 transitions. [2020-02-10 19:55:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:54,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:54,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:54,949 INFO L427 AbstractCegarLoop]: === Iteration 1340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1267178811, now seen corresponding path program 1333 times [2020-02-10 19:55:54,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:54,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141210884] [2020-02-10 19:55:54,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:55,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141210884] [2020-02-10 19:55:55,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:55,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:55,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201265428] [2020-02-10 19:55:55,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:55,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:55,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:55,298 INFO L87 Difference]: Start difference. First operand 774 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:55:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,417 INFO L93 Difference]: Finished difference Result 1241 states and 4351 transitions. [2020-02-10 19:55:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:55,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,421 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 19:55:55,421 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 19:55:55,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 19:55:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 785. [2020-02-10 19:55:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 19:55:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-02-10 19:55:55,443 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-02-10 19:55:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:55,443 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-02-10 19:55:55,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-02-10 19:55:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:55,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:55,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:55,444 INFO L427 AbstractCegarLoop]: === Iteration 1341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 194093431, now seen corresponding path program 1334 times [2020-02-10 19:55:55,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:55,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89756880] [2020-02-10 19:55:55,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:55,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89756880] [2020-02-10 19:55:55,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:55,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:55,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853324860] [2020-02-10 19:55:55,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:55,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:55,796 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-02-10 19:55:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,926 INFO L93 Difference]: Finished difference Result 1242 states and 4347 transitions. [2020-02-10 19:55:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:55,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,930 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 19:55:55,930 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 19:55:55,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 19:55:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 779. [2020-02-10 19:55:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 19:55:55,952 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 19:55:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:55,952 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 19:55:55,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 19:55:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:55,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:55,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:55,953 INFO L427 AbstractCegarLoop]: === Iteration 1342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash -333259043, now seen corresponding path program 1335 times [2020-02-10 19:55:55,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:55,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151981442] [2020-02-10 19:55:55,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:56,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 19:55:56,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151981442] [2020-02-10 19:55:56,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:56,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:56,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380942446] [2020-02-10 19:55:56,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:56,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:56,307 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:55:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:56,431 INFO L93 Difference]: Finished difference Result 1238 states and 4339 transitions. [2020-02-10 19:55:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:56,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:56,435 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:55:56,435 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 19:55:56,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 19:55:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 784. [2020-02-10 19:55:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:55:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 19:55:56,457 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 19:55:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:56,457 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 19:55:56,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 19:55:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:56,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:56,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:56,458 INFO L427 AbstractCegarLoop]: === Iteration 1343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 204596535, now seen corresponding path program 1336 times [2020-02-10 19:55:56,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627231247] [2020-02-10 19:55:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:56,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 19:55:56,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627231247] [2020-02-10 19:55:56,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:56,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:56,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371972429] [2020-02-10 19:55:56,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:56,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:56,809 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 19:55:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:56,942 INFO L93 Difference]: Finished difference Result 1237 states and 4332 transitions. [2020-02-10 19:55:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:56,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:56,946 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 19:55:56,946 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:55:56,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:55:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 779. [2020-02-10 19:55:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:55:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:55:56,967 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:55:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:56,967 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:55:56,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:55:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:56,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:56,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:56,969 INFO L427 AbstractCegarLoop]: === Iteration 1344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -312252835, now seen corresponding path program 1337 times [2020-02-10 19:55:56,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:56,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608274726] [2020-02-10 19:55:56,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:57,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608274726] [2020-02-10 19:55:57,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:57,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:57,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988987571] [2020-02-10 19:55:57,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:57,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:57,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:57,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:57,330 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:55:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:57,455 INFO L93 Difference]: Finished difference Result 1240 states and 4338 transitions. [2020-02-10 19:55:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:57,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:57,458 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 19:55:57,458 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 19:55:57,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 19:55:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 784. [2020-02-10 19:55:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:55:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3105 transitions. [2020-02-10 19:55:57,480 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3105 transitions. Word has length 25 [2020-02-10 19:55:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:57,480 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3105 transitions. [2020-02-10 19:55:57,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3105 transitions. [2020-02-10 19:55:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:57,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55: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] [2020-02-10 19:55:57,482 INFO L427 AbstractCegarLoop]: === Iteration 1345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:57,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1298688123, now seen corresponding path program 1338 times [2020-02-10 19:55:57,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:57,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350148816] [2020-02-10 19:55:57,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:57,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350148816] [2020-02-10 19:55:57,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:57,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:57,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700463814] [2020-02-10 19:55:57,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:57,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:57,845 INFO L87 Difference]: Start difference. First operand 784 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:55:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:57,967 INFO L93 Difference]: Finished difference Result 1238 states and 4329 transitions. [2020-02-10 19:55:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:57,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:57,970 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 19:55:57,971 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 19:55:57,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 19:55:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 774. [2020-02-10 19:55:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 19:55:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3084 transitions. [2020-02-10 19:55:57,992 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3084 transitions. Word has length 25 [2020-02-10 19:55:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:57,993 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3084 transitions. [2020-02-10 19:55:57,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3084 transitions. [2020-02-10 19:55:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:57,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:57,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:57,994 INFO L427 AbstractCegarLoop]: === Iteration 1346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1091251303, now seen corresponding path program 1339 times [2020-02-10 19:55:57,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:57,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981632439] [2020-02-10 19:55:57,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:58,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981632439] [2020-02-10 19:55:58,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:58,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038118470] [2020-02-10 19:55:58,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:58,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:58,329 INFO L87 Difference]: Start difference. First operand 774 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:55:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:58,444 INFO L93 Difference]: Finished difference Result 1222 states and 4298 transitions. [2020-02-10 19:55:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:58,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:58,448 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:55:58,448 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:55:58,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:55:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-02-10 19:55:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 19:55:58,469 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 19:55:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:58,470 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 19:55:58,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 19:55:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:58,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:58,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:58,471 INFO L427 AbstractCegarLoop]: === Iteration 1347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 519689655, now seen corresponding path program 1340 times [2020-02-10 19:55:58,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:58,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508410669] [2020-02-10 19:55:58,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:58,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508410669] [2020-02-10 19:55:58,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:58,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898044988] [2020-02-10 19:55:58,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:58,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:58,802 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:55:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:58,924 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-02-10 19:55:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:58,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:58,927 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 19:55:58,927 INFO L226 Difference]: Without dead ends: 1207 [2020-02-10 19:55:58,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-02-10 19:55:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 777. [2020-02-10 19:55:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:55:58,949 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:55:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:58,949 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:55:58,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:55:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:58,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:58,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:58,950 INFO L427 AbstractCegarLoop]: === Iteration 1348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1603278139, now seen corresponding path program 1341 times [2020-02-10 19:55:58,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:58,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674183454] [2020-02-10 19:55:58,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:59,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674183454] [2020-02-10 19:55:59,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:59,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:59,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301552774] [2020-02-10 19:55:59,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:59,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:59,290 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:55:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:59,402 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-02-10 19:55:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:59,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:59,405 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 19:55:59,406 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 19:55:59,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 19:55:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-02-10 19:55:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:55:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3097 transitions. [2020-02-10 19:55:59,427 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3097 transitions. Word has length 25 [2020-02-10 19:55:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:59,427 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3097 transitions. [2020-02-10 19:55:59,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3097 transitions. [2020-02-10 19:55:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:59,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:59,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] [2020-02-10 19:55:59,428 INFO L427 AbstractCegarLoop]: === Iteration 1349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash 530192759, now seen corresponding path program 1342 times [2020-02-10 19:55:59,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:59,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944659911] [2020-02-10 19:55:59,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:59,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944659911] [2020-02-10 19:55:59,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:59,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:55:59,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324898978] [2020-02-10 19:55:59,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:55:59,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:59,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:55:59,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:55:59,772 INFO L87 Difference]: Start difference. First operand 780 states and 3097 transitions. Second operand 10 states. [2020-02-10 19:55:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:59,901 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-02-10 19:55:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:55:59,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:55:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:59,904 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:55:59,904 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 19:55:59,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 19:55:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-02-10 19:55:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:55:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3089 transitions. [2020-02-10 19:55:59,926 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3089 transitions. Word has length 25 [2020-02-10 19:55:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:59,926 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3089 transitions. [2020-02-10 19:55:59,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:55:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3089 transitions. [2020-02-10 19:55:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:55:59,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:59,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:59,927 INFO L427 AbstractCegarLoop]: === Iteration 1350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1613781243, now seen corresponding path program 1343 times [2020-02-10 19:55:59,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:59,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097353872] [2020-02-10 19:55:59,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:00,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097353872] [2020-02-10 19:56:00,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:00,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:00,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373509574] [2020-02-10 19:56:00,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:00,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:00,270 INFO L87 Difference]: Start difference. First operand 777 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:56:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:00,392 INFO L93 Difference]: Finished difference Result 1230 states and 4310 transitions. [2020-02-10 19:56:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:00,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:00,395 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 19:56:00,395 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 19:56:00,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 19:56:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 782. [2020-02-10 19:56:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:56:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3098 transitions. [2020-02-10 19:56:00,417 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3098 transitions. Word has length 25 [2020-02-10 19:56:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:00,417 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3098 transitions. [2020-02-10 19:56:00,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3098 transitions. [2020-02-10 19:56:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:00,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:00,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] [2020-02-10 19:56:00,418 INFO L427 AbstractCegarLoop]: === Iteration 1351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1070245095, now seen corresponding path program 1344 times [2020-02-10 19:56:00,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:00,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757101293] [2020-02-10 19:56:00,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:00,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757101293] [2020-02-10 19:56:00,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:00,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:00,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834339975] [2020-02-10 19:56:00,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:00,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:00,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:00,754 INFO L87 Difference]: Start difference. First operand 782 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:56:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:00,891 INFO L93 Difference]: Finished difference Result 1228 states and 4301 transitions. [2020-02-10 19:56:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:00,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:00,895 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 19:56:00,895 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 19:56:00,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 19:56:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 771. [2020-02-10 19:56:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:56:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 19:56:00,916 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 19:56:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:00,917 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 19:56:00,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 19:56:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:00,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:00,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] [2020-02-10 19:56:00,918 INFO L427 AbstractCegarLoop]: === Iteration 1352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1829422943, now seen corresponding path program 1345 times [2020-02-10 19:56:00,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:00,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413727467] [2020-02-10 19:56:00,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:01,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 19:56:01,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413727467] [2020-02-10 19:56:01,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:01,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:01,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027961747] [2020-02-10 19:56:01,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:01,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:01,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:01,270 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 19:56:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:01,387 INFO L93 Difference]: Finished difference Result 1210 states and 4262 transitions. [2020-02-10 19:56:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:01,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:01,391 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 19:56:01,391 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:56:01,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:56:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-02-10 19:56:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:56:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 19:56:01,412 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 19:56:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:01,412 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 19:56:01,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 19:56:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:01,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:01,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:01,413 INFO L427 AbstractCegarLoop]: === Iteration 1353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -218481985, now seen corresponding path program 1346 times [2020-02-10 19:56:01,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:01,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958503671] [2020-02-10 19:56:01,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:01,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958503671] [2020-02-10 19:56:01,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:01,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:01,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834152858] [2020-02-10 19:56:01,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:01,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:01,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:01,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:01,754 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 19:56:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:01,881 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-02-10 19:56:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:01,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:01,885 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:56:01,885 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:56:01,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:56:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-02-10 19:56:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:56:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 19:56:01,907 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 19:56:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:01,907 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 19:56:01,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 19:56:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:01,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:01,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] [2020-02-10 19:56:01,908 INFO L427 AbstractCegarLoop]: === Iteration 1354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash 865106499, now seen corresponding path program 1347 times [2020-02-10 19:56:01,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:01,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441501034] [2020-02-10 19:56:01,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:02,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441501034] [2020-02-10 19:56:02,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:02,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:02,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330860903] [2020-02-10 19:56:02,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:02,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:02,259 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:56:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:02,378 INFO L93 Difference]: Finished difference Result 1217 states and 4276 transitions. [2020-02-10 19:56:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:02,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:02,381 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 19:56:02,381 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 19:56:02,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 19:56:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 19:56:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 19:56:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3105 transitions. [2020-02-10 19:56:02,403 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3105 transitions. Word has length 25 [2020-02-10 19:56:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:02,403 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3105 transitions. [2020-02-10 19:56:02,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3105 transitions. [2020-02-10 19:56:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:02,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:02,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:02,404 INFO L427 AbstractCegarLoop]: === Iteration 1355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash -207978881, now seen corresponding path program 1348 times [2020-02-10 19:56:02,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:02,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275964076] [2020-02-10 19:56:02,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:02,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275964076] [2020-02-10 19:56:02,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:02,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:02,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659707234] [2020-02-10 19:56:02,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:02,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:02,759 INFO L87 Difference]: Start difference. First operand 782 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:56:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:02,890 INFO L93 Difference]: Finished difference Result 1218 states and 4272 transitions. [2020-02-10 19:56:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:02,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:02,894 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 19:56:02,894 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:56:02,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:56:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 776. [2020-02-10 19:56:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:56:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 19:56:02,916 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 19:56:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:02,916 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 19:56:02,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 19:56:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:02,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:02,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:02,917 INFO L427 AbstractCegarLoop]: === Iteration 1356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 875609603, now seen corresponding path program 1349 times [2020-02-10 19:56:02,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:02,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570612544] [2020-02-10 19:56:02,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:03,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570612544] [2020-02-10 19:56:03,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:03,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:03,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895767873] [2020-02-10 19:56:03,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:03,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:03,266 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:56:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,414 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-02-10 19:56:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:03,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,417 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:56:03,417 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 19:56:03,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 19:56:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-02-10 19:56:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:56:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 19:56:03,439 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 19:56:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,439 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 19:56:03,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 19:56:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:03,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:03,440 INFO L427 AbstractCegarLoop]: === Iteration 1357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1808416735, now seen corresponding path program 1350 times [2020-02-10 19:56:03,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080662146] [2020-02-10 19:56:03,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:03,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080662146] [2020-02-10 19:56:03,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:03,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:03,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381241464] [2020-02-10 19:56:03,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:03,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:03,792 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:56:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,915 INFO L93 Difference]: Finished difference Result 1212 states and 4257 transitions. [2020-02-10 19:56:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:03,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,918 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:56:03,919 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:56:03,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:56:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 773. [2020-02-10 19:56:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 19:56:03,940 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 19:56:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,940 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 19:56:03,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 19:56:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:03,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:03,942 INFO L427 AbstractCegarLoop]: === Iteration 1358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash -346288005, now seen corresponding path program 1351 times [2020-02-10 19:56:03,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360879338] [2020-02-10 19:56:03,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:04,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360879338] [2020-02-10 19:56:04,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:04,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:04,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352837344] [2020-02-10 19:56:04,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:04,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:04,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:04,301 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:56:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:04,432 INFO L93 Difference]: Finished difference Result 1199 states and 4231 transitions. [2020-02-10 19:56:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:04,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:04,435 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 19:56:04,435 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:56:04,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:56:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 778. [2020-02-10 19:56:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:56:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:56:04,456 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:56:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:04,456 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:56:04,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:56:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:04,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:04,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:04,457 INFO L427 AbstractCegarLoop]: === Iteration 1359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1264652953, now seen corresponding path program 1352 times [2020-02-10 19:56:04,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:04,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481869025] [2020-02-10 19:56:04,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:04,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481869025] [2020-02-10 19:56:04,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:04,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:04,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166574399] [2020-02-10 19:56:04,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:04,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:04,804 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:56:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:04,927 INFO L93 Difference]: Finished difference Result 1196 states and 4222 transitions. [2020-02-10 19:56:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:04,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:04,931 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:56:04,931 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:56:04,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:56:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 19:56:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 19:56:04,952 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 19:56:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:04,952 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 19:56:04,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 19:56:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:04,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:04,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:04,953 INFO L427 AbstractCegarLoop]: === Iteration 1360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1841895171, now seen corresponding path program 1353 times [2020-02-10 19:56:04,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:04,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074964960] [2020-02-10 19:56:04,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:05,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074964960] [2020-02-10 19:56:05,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:05,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:05,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395972135] [2020-02-10 19:56:05,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:05,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:05,296 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:56:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:05,453 INFO L93 Difference]: Finished difference Result 1197 states and 4224 transitions. [2020-02-10 19:56:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:05,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:05,456 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 19:56:05,457 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:56:05,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:56:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 19:56:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 19:56:05,479 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 19:56:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:05,479 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 19:56:05,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 19:56:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:05,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:05,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] [2020-02-10 19:56:05,480 INFO L427 AbstractCegarLoop]: === Iteration 1361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1306665369, now seen corresponding path program 1354 times [2020-02-10 19:56:05,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:05,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135134618] [2020-02-10 19:56:05,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:05,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135134618] [2020-02-10 19:56:05,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:05,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:05,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249261922] [2020-02-10 19:56:05,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:05,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:05,827 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:56:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:05,962 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 19:56:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:05,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:05,966 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:56:05,966 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:56:05,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:56:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-02-10 19:56:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:56:05,987 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:56:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:05,987 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:56:05,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:56:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:05,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:05,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:05,988 INFO L427 AbstractCegarLoop]: === Iteration 1362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1852398275, now seen corresponding path program 1355 times [2020-02-10 19:56:05,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:05,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656166310] [2020-02-10 19:56:05,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,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 19:56:06,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656166310] [2020-02-10 19:56:06,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:06,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983254948] [2020-02-10 19:56:06,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:06,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:06,338 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:56:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:06,470 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-02-10 19:56:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:06,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:06,473 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:56:06,473 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:56:06,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:56:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 19:56:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:56:06,495 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:56:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:06,495 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:56:06,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:56:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:06,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:06,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] [2020-02-10 19:56:06,497 INFO L427 AbstractCegarLoop]: === Iteration 1363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -293772485, now seen corresponding path program 1356 times [2020-02-10 19:56:06,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:06,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348214750] [2020-02-10 19:56:06,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:06,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348214750] [2020-02-10 19:56:06,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:06,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888677391] [2020-02-10 19:56:06,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:06,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:06,858 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:56:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,008 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-02-10 19:56:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:07,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,011 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:56:07,011 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:56:07,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:56:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 19:56:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:56:07,034 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:56:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,034 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:56:07,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:56:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:07,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,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] [2020-02-10 19:56:07,035 INFO L427 AbstractCegarLoop]: === Iteration 1364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash -20691781, now seen corresponding path program 1357 times [2020-02-10 19:56:07,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541186556] [2020-02-10 19:56:07,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:07,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541186556] [2020-02-10 19:56:07,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:07,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:07,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126241111] [2020-02-10 19:56:07,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:07,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:07,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:07,389 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:56:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,535 INFO L93 Difference]: Finished difference Result 1213 states and 4263 transitions. [2020-02-10 19:56:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:07,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,539 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 19:56:07,539 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:56:07,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:56:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 19:56:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:56:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-02-10 19:56:07,560 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-02-10 19:56:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,560 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-02-10 19:56:07,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-02-10 19:56:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:07,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:07,562 INFO L427 AbstractCegarLoop]: === Iteration 1365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1093777161, now seen corresponding path program 1358 times [2020-02-10 19:56:07,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031365010] [2020-02-10 19:56:07,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:07,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031365010] [2020-02-10 19:56:07,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:07,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:07,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803323503] [2020-02-10 19:56:07,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:07,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:07,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:07,898 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:56:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:08,035 INFO L93 Difference]: Finished difference Result 1214 states and 4259 transitions. [2020-02-10 19:56:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:08,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:08,039 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:56:08,039 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 19:56:08,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 19:56:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 19:56:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:56:08,061 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:56:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:08,061 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:56:08,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:56:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:08,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:08,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:08,062 INFO L427 AbstractCegarLoop]: === Iteration 1366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -527038047, now seen corresponding path program 1359 times [2020-02-10 19:56:08,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:08,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79871216] [2020-02-10 19:56:08,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:08,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79871216] [2020-02-10 19:56:08,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:08,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:08,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135526843] [2020-02-10 19:56:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:08,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:08,399 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:56:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:08,521 INFO L93 Difference]: Finished difference Result 1204 states and 4239 transitions. [2020-02-10 19:56:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:08,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:08,524 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:56:08,524 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:56:08,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:56:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-02-10 19:56:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:56:08,545 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:56:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:08,545 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:56:08,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:56:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:08,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:08,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:08,547 INFO L427 AbstractCegarLoop]: === Iteration 1367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1062267849, now seen corresponding path program 1360 times [2020-02-10 19:56:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094878364] [2020-02-10 19:56:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:08,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094878364] [2020-02-10 19:56:08,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:08,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:08,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280641942] [2020-02-10 19:56:08,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:08,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:08,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:08,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:08,876 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:56:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:09,025 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 19:56:09,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:09,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:09,028 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:56:09,028 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 19:56:09,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 19:56:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-02-10 19:56:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:56:09,049 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:56:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:09,049 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:56:09,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:56:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:09,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:09,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:09,051 INFO L427 AbstractCegarLoop]: === Iteration 1368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash -506031839, now seen corresponding path program 1361 times [2020-02-10 19:56:09,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:09,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767278419] [2020-02-10 19:56:09,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:09,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767278419] [2020-02-10 19:56:09,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:09,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:09,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927144794] [2020-02-10 19:56:09,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:09,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:09,394 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:56:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:09,531 INFO L93 Difference]: Finished difference Result 1206 states and 4241 transitions. [2020-02-10 19:56:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:09,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:09,534 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 19:56:09,534 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 19:56:09,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 19:56:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 19:56:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:56:09,555 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:56:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:09,555 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:56:09,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:56:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:09,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:09,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:09,557 INFO L427 AbstractCegarLoop]: === Iteration 1369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 31823739, now seen corresponding path program 1362 times [2020-02-10 19:56:09,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:09,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109213170] [2020-02-10 19:56:09,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:09,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109213170] [2020-02-10 19:56:09,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:09,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:09,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728095611] [2020-02-10 19:56:09,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:09,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:09,897 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:56:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:10,027 INFO L93 Difference]: Finished difference Result 1201 states and 4229 transitions. [2020-02-10 19:56:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:10,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:10,030 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:56:10,030 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:56:10,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:56:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-02-10 19:56:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:56:10,051 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:56:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:10,051 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:56:10,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:56:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:10,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:10,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:10,052 INFO L427 AbstractCegarLoop]: === Iteration 1370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1915845401, now seen corresponding path program 1363 times [2020-02-10 19:56:10,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:10,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10020972] [2020-02-10 19:56:10,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:10,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10020972] [2020-02-10 19:56:10,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:10,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883168123] [2020-02-10 19:56:10,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:10,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:10,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:10,401 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:56:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:10,544 INFO L93 Difference]: Finished difference Result 1198 states and 4225 transitions. [2020-02-10 19:56:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:10,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:10,547 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:56:10,547 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:56:10,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:56:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 778. [2020-02-10 19:56:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:56:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 19:56:10,569 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 19:56:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:10,569 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 19:56:10,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 19:56:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:10,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:10,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:10,570 INFO L427 AbstractCegarLoop]: === Iteration 1371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -768180937, now seen corresponding path program 1364 times [2020-02-10 19:56:10,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:10,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347374775] [2020-02-10 19:56:10,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,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 19:56:10,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347374775] [2020-02-10 19:56:10,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:10,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523657590] [2020-02-10 19:56:10,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:10,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:10,926 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:56:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:11,071 INFO L93 Difference]: Finished difference Result 1202 states and 4230 transitions. [2020-02-10 19:56:11,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:11,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:11,075 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:56:11,075 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 19:56:11,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 19:56:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-02-10 19:56:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:56:11,096 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:56:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:11,097 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:56:11,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:56:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:11,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:11,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:11,098 INFO L427 AbstractCegarLoop]: === Iteration 1372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1409499135, now seen corresponding path program 1365 times [2020-02-10 19:56:11,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:11,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771673405] [2020-02-10 19:56:11,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:11,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771673405] [2020-02-10 19:56:11,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:11,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:11,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100191253] [2020-02-10 19:56:11,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:11,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:11,442 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:56:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:11,574 INFO L93 Difference]: Finished difference Result 1192 states and 4210 transitions. [2020-02-10 19:56:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:11,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:11,577 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 19:56:11,577 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 19:56:11,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 19:56:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 19:56:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:56:11,598 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:56:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:11,598 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:56:11,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:56:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:11,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:11,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] [2020-02-10 19:56:11,599 INFO L427 AbstractCegarLoop]: === Iteration 1373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash -736671625, now seen corresponding path program 1366 times [2020-02-10 19:56:11,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:11,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422109990] [2020-02-10 19:56:11,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:11,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 19:56:11,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422109990] [2020-02-10 19:56:11,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:11,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:11,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053411677] [2020-02-10 19:56:11,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:11,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:11,942 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:56:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,086 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-02-10 19:56:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:12,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,090 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:56:12,090 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:56:12,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:56:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:56:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:56:12,112 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:56:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:12,112 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:56:12,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:56:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:12,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:12,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:12,113 INFO L427 AbstractCegarLoop]: === Iteration 1374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:12,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1420002239, now seen corresponding path program 1367 times [2020-02-10 19:56:12,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:12,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733417345] [2020-02-10 19:56:12,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:12,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733417345] [2020-02-10 19:56:12,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:12,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:12,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021627886] [2020-02-10 19:56:12,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:12,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:12,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:12,460 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:56:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,595 INFO L93 Difference]: Finished difference Result 1200 states and 4224 transitions. [2020-02-10 19:56:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:12,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,599 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:56:12,599 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:56:12,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:56:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 19:56:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:56:12,621 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:56:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:12,621 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:56:12,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:56:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:12,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:12,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:12,623 INFO L427 AbstractCegarLoop]: === Iteration 1375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1957857817, now seen corresponding path program 1368 times [2020-02-10 19:56:12,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:12,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850524937] [2020-02-10 19:56:12,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:12,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850524937] [2020-02-10 19:56:12,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:12,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:12,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724999806] [2020-02-10 19:56:12,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:12,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:12,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:12,968 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:56:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:13,125 INFO L93 Difference]: Finished difference Result 1195 states and 4212 transitions. [2020-02-10 19:56:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:13,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:13,128 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 19:56:13,128 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:56:13,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:56:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 771. [2020-02-10 19:56:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:56:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 19:56:13,150 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 19:56:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,150 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 19:56:13,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 19:56:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:13,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:13,151 INFO L427 AbstractCegarLoop]: === Iteration 1376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash -325874591, now seen corresponding path program 1369 times [2020-02-10 19:56:13,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496081129] [2020-02-10 19:56:13,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:13,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 19:56:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496081129] [2020-02-10 19:56:13,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:13,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:13,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910117056] [2020-02-10 19:56:13,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:13,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:13,511 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 19:56:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:13,660 INFO L93 Difference]: Finished difference Result 1204 states and 4246 transitions. [2020-02-10 19:56:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:13,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:13,664 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:56:13,664 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:56:13,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:56:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 779. [2020-02-10 19:56:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:56:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 19:56:13,686 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 19:56:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,686 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 19:56:13,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 19:56:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:13,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:13,687 INFO L427 AbstractCegarLoop]: === Iteration 1377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1285066367, now seen corresponding path program 1370 times [2020-02-10 19:56:13,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79349653] [2020-02-10 19:56:13,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:14,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79349653] [2020-02-10 19:56:14,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:14,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:14,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616663048] [2020-02-10 19:56:14,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:14,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:14,040 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:56:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:14,188 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-02-10 19:56:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:14,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:14,190 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 19:56:14,190 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 19:56:14,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 19:56:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 776. [2020-02-10 19:56:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:56:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3092 transitions. [2020-02-10 19:56:14,212 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3092 transitions. Word has length 25 [2020-02-10 19:56:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:14,212 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3092 transitions. [2020-02-10 19:56:14,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3092 transitions. [2020-02-10 19:56:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:14,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:14,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:14,214 INFO L427 AbstractCegarLoop]: === Iteration 1378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash 768216997, now seen corresponding path program 1371 times [2020-02-10 19:56:14,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:14,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76784186] [2020-02-10 19:56:14,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:14,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76784186] [2020-02-10 19:56:14,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:14,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:14,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048668918] [2020-02-10 19:56:14,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:14,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:14,563 INFO L87 Difference]: Start difference. First operand 776 states and 3092 transitions. Second operand 10 states. [2020-02-10 19:56:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:14,716 INFO L93 Difference]: Finished difference Result 1208 states and 4253 transitions. [2020-02-10 19:56:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:14,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:14,719 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:56:14,719 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 19:56:14,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 19:56:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 781. [2020-02-10 19:56:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:56:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-02-10 19:56:14,741 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-02-10 19:56:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:14,741 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-02-10 19:56:14,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-02-10 19:56:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:14,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:14,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:14,742 INFO L427 AbstractCegarLoop]: === Iteration 1379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1306072575, now seen corresponding path program 1372 times [2020-02-10 19:56:14,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:14,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499794724] [2020-02-10 19:56:14,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:15,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499794724] [2020-02-10 19:56:15,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:15,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:15,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443156676] [2020-02-10 19:56:15,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:15,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:15,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:15,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:15,088 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-02-10 19:56:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:15,226 INFO L93 Difference]: Finished difference Result 1207 states and 4246 transitions. [2020-02-10 19:56:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:15,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:15,230 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 19:56:15,230 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:56:15,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:56:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-02-10 19:56:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 19:56:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3089 transitions. [2020-02-10 19:56:15,251 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3089 transitions. Word has length 25 [2020-02-10 19:56:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:15,251 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3089 transitions. [2020-02-10 19:56:15,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3089 transitions. [2020-02-10 19:56:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:15,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:15,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:15,252 INFO L427 AbstractCegarLoop]: === Iteration 1380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash 778720101, now seen corresponding path program 1373 times [2020-02-10 19:56:15,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:15,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950540477] [2020-02-10 19:56:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:15,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 19:56:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950540477] [2020-02-10 19:56:15,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:15,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:15,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778835580] [2020-02-10 19:56:15,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:15,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:15,600 INFO L87 Difference]: Start difference. First operand 776 states and 3089 transitions. Second operand 10 states. [2020-02-10 19:56:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:15,745 INFO L93 Difference]: Finished difference Result 1200 states and 4232 transitions. [2020-02-10 19:56:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:15,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:15,749 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 19:56:15,749 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 19:56:15,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 19:56:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-02-10 19:56:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 19:56:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3094 transitions. [2020-02-10 19:56:15,770 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3094 transitions. Word has length 25 [2020-02-10 19:56:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:15,770 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3094 transitions. [2020-02-10 19:56:15,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3094 transitions. [2020-02-10 19:56:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:15,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:15,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:15,771 INFO L427 AbstractCegarLoop]: === Iteration 1381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -294365279, now seen corresponding path program 1374 times [2020-02-10 19:56:15,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:15,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019393363] [2020-02-10 19:56:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,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 19:56:16,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019393363] [2020-02-10 19:56:16,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:16,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237684793] [2020-02-10 19:56:16,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:16,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:16,114 INFO L87 Difference]: Start difference. First operand 779 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:56:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:16,262 INFO L93 Difference]: Finished difference Result 1202 states and 4233 transitions. [2020-02-10 19:56:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:16,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:16,265 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 19:56:16,265 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:56:16,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:56:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 19:56:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 19:56:16,287 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 19:56:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:16,287 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 19:56:16,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 19:56:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:16,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:16,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:16,288 INFO L427 AbstractCegarLoop]: === Iteration 1382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash -768773731, now seen corresponding path program 1375 times [2020-02-10 19:56:16,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:16,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632865114] [2020-02-10 19:56:16,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:16,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632865114] [2020-02-10 19:56:16,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:16,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561359524] [2020-02-10 19:56:16,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:16,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:16,636 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 19:56:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:16,766 INFO L93 Difference]: Finished difference Result 1196 states and 4222 transitions. [2020-02-10 19:56:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:16,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:16,770 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:56:16,770 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:56:16,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:56:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2020-02-10 19:56:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:56:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 19:56:16,792 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 19:56:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:16,792 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 19:56:16,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 19:56:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:16,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:16,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:16,793 INFO L427 AbstractCegarLoop]: === Iteration 1383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 842167227, now seen corresponding path program 1376 times [2020-02-10 19:56:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:16,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504861386] [2020-02-10 19:56:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:17,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 19:56:17,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504861386] [2020-02-10 19:56:17,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:17,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:17,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930559843] [2020-02-10 19:56:17,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:17,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:17,137 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 19:56:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:17,269 INFO L93 Difference]: Finished difference Result 1193 states and 4213 transitions. [2020-02-10 19:56:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:17,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:17,272 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:56:17,272 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:56:17,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:56:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 19:56:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 19:56:17,294 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 19:56:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:17,294 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 19:56:17,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 19:56:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:17,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:17,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:17,295 INFO L427 AbstractCegarLoop]: === Iteration 1384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1419409445, now seen corresponding path program 1377 times [2020-02-10 19:56:17,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:17,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818140509] [2020-02-10 19:56:17,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:17,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818140509] [2020-02-10 19:56:17,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:17,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:17,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384019836] [2020-02-10 19:56:17,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:17,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:17,641 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 19:56:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:17,766 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-02-10 19:56:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:17,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:17,769 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:56:17,769 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:56:17,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:56:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 19:56:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 19:56:17,791 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 19:56:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:17,791 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 19:56:17,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 19:56:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:17,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:17,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] [2020-02-10 19:56:17,792 INFO L427 AbstractCegarLoop]: === Iteration 1385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:17,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash 884179643, now seen corresponding path program 1378 times [2020-02-10 19:56:17,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:17,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944472814] [2020-02-10 19:56:17,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:18,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944472814] [2020-02-10 19:56:18,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:18,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:18,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484379121] [2020-02-10 19:56:18,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:18,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:18,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:18,129 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:56:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:18,271 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 19:56:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:18,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:18,274 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 19:56:18,274 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:56:18,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:56:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 19:56:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:56:18,295 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:56:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:18,295 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:56:18,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:56:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:18,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:18,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:18,296 INFO L427 AbstractCegarLoop]: === Iteration 1386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1429912549, now seen corresponding path program 1379 times [2020-02-10 19:56:18,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:18,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739095960] [2020-02-10 19:56:18,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:18,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739095960] [2020-02-10 19:56:18,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:18,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:18,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428193848] [2020-02-10 19:56:18,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:18,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:18,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:18,648 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:56:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:18,783 INFO L93 Difference]: Finished difference Result 1188 states and 4201 transitions. [2020-02-10 19:56:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:18,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:18,786 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:56:18,786 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:56:18,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:56:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 19:56:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:56:18,808 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:56:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:18,808 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:56:18,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:56:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:18,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:18,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:18,809 INFO L427 AbstractCegarLoop]: === Iteration 1387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash -716258211, now seen corresponding path program 1380 times [2020-02-10 19:56:18,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:18,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020455112] [2020-02-10 19:56:18,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:19,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020455112] [2020-02-10 19:56:19,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:19,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:19,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370922278] [2020-02-10 19:56:19,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:19,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:19,159 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:56:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:19,297 INFO L93 Difference]: Finished difference Result 1187 states and 4197 transitions. [2020-02-10 19:56:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:19,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:19,301 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:56:19,301 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 19:56:19,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 19:56:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 19:56:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:56:19,323 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:56:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:19,323 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:56:19,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:56:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:19,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:19,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:19,324 INFO L427 AbstractCegarLoop]: === Iteration 1388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash -117581283, now seen corresponding path program 1381 times [2020-02-10 19:56:19,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:19,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101789424] [2020-02-10 19:56:19,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:19,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101789424] [2020-02-10 19:56:19,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:19,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:19,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145423904] [2020-02-10 19:56:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:19,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:19,668 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:56:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:19,814 INFO L93 Difference]: Finished difference Result 1204 states and 4240 transitions. [2020-02-10 19:56:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:19,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:19,817 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 19:56:19,817 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 19:56:19,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 19:56:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-02-10 19:56:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 19:56:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 19:56:19,838 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 19:56:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:19,838 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 19:56:19,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 19:56:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:19,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:19,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:19,840 INFO L427 AbstractCegarLoop]: === Iteration 1389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash 420274295, now seen corresponding path program 1382 times [2020-02-10 19:56:19,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:19,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111191996] [2020-02-10 19:56:19,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:20,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111191996] [2020-02-10 19:56:20,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:20,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245174380] [2020-02-10 19:56:20,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:20,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:20,192 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:56:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:20,340 INFO L93 Difference]: Finished difference Result 1203 states and 4233 transitions. [2020-02-10 19:56:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:20,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:20,344 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 19:56:20,344 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 19:56:20,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 19:56:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-02-10 19:56:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:56:20,366 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:56:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:20,366 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:56:20,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:56:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:20,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:20,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:20,367 INFO L427 AbstractCegarLoop]: === Iteration 1390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 976510305, now seen corresponding path program 1383 times [2020-02-10 19:56:20,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:20,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818653291] [2020-02-10 19:56:20,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:20,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818653291] [2020-02-10 19:56:20,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:20,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61342017] [2020-02-10 19:56:20,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:20,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:20,704 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:56:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:20,850 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-02-10 19:56:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:20,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:20,853 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 19:56:20,854 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 19:56:20,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 19:56:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-02-10 19:56:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:56:20,875 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:56:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:20,875 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:56:20,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:56:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:20,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:20,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:20,876 INFO L427 AbstractCegarLoop]: === Iteration 1391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 441280503, now seen corresponding path program 1384 times [2020-02-10 19:56:20,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:20,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421782204] [2020-02-10 19:56:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:21,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421782204] [2020-02-10 19:56:21,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:21,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:21,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221749207] [2020-02-10 19:56:21,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:21,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:21,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:21,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:21,217 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:56:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:21,359 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-02-10 19:56:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:21,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:21,362 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 19:56:21,363 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 19:56:21,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 19:56:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 19:56:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:56:21,384 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:56:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:21,384 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:56:21,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:56:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:21,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:21,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:21,385 INFO L427 AbstractCegarLoop]: === Iteration 1392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1008019617, now seen corresponding path program 1385 times [2020-02-10 19:56:21,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:21,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083137734] [2020-02-10 19:56:21,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:21,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083137734] [2020-02-10 19:56:21,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:21,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:21,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391411017] [2020-02-10 19:56:21,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:21,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:21,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:21,724 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:56:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:21,863 INFO L93 Difference]: Finished difference Result 1196 states and 4217 transitions. [2020-02-10 19:56:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:21,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:21,866 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 19:56:21,866 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 19:56:21,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 19:56:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 19:56:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:56:21,888 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:56:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:21,888 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:56:21,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:56:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:21,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56: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] [2020-02-10 19:56:21,889 INFO L427 AbstractCegarLoop]: === Iteration 1393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -65065763, now seen corresponding path program 1386 times [2020-02-10 19:56:21,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:21,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406227000] [2020-02-10 19:56:21,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:22,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406227000] [2020-02-10 19:56:22,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:22,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:22,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459638018] [2020-02-10 19:56:22,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:22,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:22,230 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:56:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:22,366 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-02-10 19:56:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:22,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:22,370 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:56:22,370 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 19:56:22,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 19:56:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 19:56:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 19:56:22,390 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 19:56:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:22,390 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 19:56:22,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 19:56:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:22,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:22,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:22,392 INFO L427 AbstractCegarLoop]: === Iteration 1394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1818955899, now seen corresponding path program 1387 times [2020-02-10 19:56:22,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:22,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103956013] [2020-02-10 19:56:22,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:22,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103956013] [2020-02-10 19:56:22,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:22,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:22,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414243607] [2020-02-10 19:56:22,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:22,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:22,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:22,732 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 19:56:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:22,857 INFO L93 Difference]: Finished difference Result 1191 states and 4208 transitions. [2020-02-10 19:56:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:22,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:22,860 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:56:22,860 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 19:56:22,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 19:56:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 778. [2020-02-10 19:56:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:56:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3090 transitions. [2020-02-10 19:56:22,881 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3090 transitions. Word has length 25 [2020-02-10 19:56:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:22,882 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3090 transitions. [2020-02-10 19:56:22,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3090 transitions. [2020-02-10 19:56:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:22,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:22,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:22,883 INFO L427 AbstractCegarLoop]: === Iteration 1395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash 745870519, now seen corresponding path program 1388 times [2020-02-10 19:56:22,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:22,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794514858] [2020-02-10 19:56:22,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:23,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794514858] [2020-02-10 19:56:23,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:23,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497254760] [2020-02-10 19:56:23,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:23,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:23,227 INFO L87 Difference]: Start difference. First operand 778 states and 3090 transitions. Second operand 10 states. [2020-02-10 19:56:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:23,363 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-02-10 19:56:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:23,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:23,367 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 19:56:23,367 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 19:56:23,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 19:56:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 19:56:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:56:23,389 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:56:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:23,389 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:56:23,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:56:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:23,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:23,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:23,390 INFO L427 AbstractCegarLoop]: === Iteration 1396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1381919809, now seen corresponding path program 1389 times [2020-02-10 19:56:23,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:23,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641417516] [2020-02-10 19:56:23,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,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 19:56:23,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641417516] [2020-02-10 19:56:23,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:23,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520636746] [2020-02-10 19:56:23,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:23,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:23,736 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:56:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:23,884 INFO L93 Difference]: Finished difference Result 1187 states and 4197 transitions. [2020-02-10 19:56:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:23,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:23,887 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 19:56:23,888 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 19:56:23,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 19:56:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 19:56:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:56:23,909 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:56:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:23,909 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:56:23,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:56:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:23,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:23,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] [2020-02-10 19:56:23,911 INFO L427 AbstractCegarLoop]: === Iteration 1397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 766876727, now seen corresponding path program 1390 times [2020-02-10 19:56:23,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:23,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016142651] [2020-02-10 19:56:23,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56: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 19:56:24,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016142651] [2020-02-10 19:56:24,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:24,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:24,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673974057] [2020-02-10 19:56:24,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:24,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:24,271 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 19:56:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:24,409 INFO L93 Difference]: Finished difference Result 1186 states and 4193 transitions. [2020-02-10 19:56:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:24,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:24,412 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 19:56:24,412 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 19:56:24,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 19:56:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 19:56:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 19:56:24,433 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 19:56:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:24,434 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 19:56:24,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 19:56:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:24,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:24,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:24,435 INFO L427 AbstractCegarLoop]: === Iteration 1398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1360913601, now seen corresponding path program 1391 times [2020-02-10 19:56:24,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065986739] [2020-02-10 19:56:24,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:24,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065986739] [2020-02-10 19:56:24,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:24,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:24,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251664873] [2020-02-10 19:56:24,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:24,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:24,775 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 19:56:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:24,912 INFO L93 Difference]: Finished difference Result 1191 states and 4203 transitions. [2020-02-10 19:56:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:24,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:24,916 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 19:56:24,916 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 19:56:24,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 19:56:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 777. [2020-02-10 19:56:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 19:56:24,937 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 19:56:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:24,937 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 19:56:24,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 19:56:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:24,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:24,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] [2020-02-10 19:56:24,938 INFO L427 AbstractCegarLoop]: === Iteration 1399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1860968315, now seen corresponding path program 1392 times [2020-02-10 19:56:24,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668170996] [2020-02-10 19:56:24,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:25,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668170996] [2020-02-10 19:56:25,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:25,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:25,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815169699] [2020-02-10 19:56:25,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:25,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:25,282 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 19:56:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:25,416 INFO L93 Difference]: Finished difference Result 1188 states and 4195 transitions. [2020-02-10 19:56:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:25,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:25,420 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 19:56:25,420 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 19:56:25,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 19:56:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 771. [2020-02-10 19:56:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 19:56:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3073 transitions. [2020-02-10 19:56:25,441 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3073 transitions. Word has length 25 [2020-02-10 19:56:25,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:25,441 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3073 transitions. [2020-02-10 19:56:25,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3073 transitions. [2020-02-10 19:56:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:25,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:25,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] [2020-02-10 19:56:25,442 INFO L427 AbstractCegarLoop]: === Iteration 1400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -422764093, now seen corresponding path program 1393 times [2020-02-10 19:56:25,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:25,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610513397] [2020-02-10 19:56:25,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:25,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610513397] [2020-02-10 19:56:25,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:25,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:25,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655751994] [2020-02-10 19:56:25,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:25,795 INFO L87 Difference]: Start difference. First operand 771 states and 3073 transitions. Second operand 10 states. [2020-02-10 19:56:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:25,944 INFO L93 Difference]: Finished difference Result 1233 states and 4323 transitions. [2020-02-10 19:56:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:25,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:25,947 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 19:56:25,947 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 19:56:25,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 19:56:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 784. [2020-02-10 19:56:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 19:56:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3112 transitions. [2020-02-10 19:56:25,969 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3112 transitions. Word has length 25 [2020-02-10 19:56:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:25,969 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3112 transitions. [2020-02-10 19:56:25,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3112 transitions. [2020-02-10 19:56:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:25,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:25,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:25,970 INFO L427 AbstractCegarLoop]: === Iteration 1401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1495849473, now seen corresponding path program 1394 times [2020-02-10 19:56:25,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:25,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990166103] [2020-02-10 19:56:25,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:26,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990166103] [2020-02-10 19:56:26,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:26,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:26,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091864580] [2020-02-10 19:56:26,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:26,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:26,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:26,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:26,321 INFO L87 Difference]: Start difference. First operand 784 states and 3112 transitions. Second operand 10 states. [2020-02-10 19:56:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:26,438 INFO L93 Difference]: Finished difference Result 1234 states and 4319 transitions. [2020-02-10 19:56:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:26,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:26,442 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 19:56:26,442 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 19:56:26,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 19:56:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 778. [2020-02-10 19:56:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:56:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 19:56:26,465 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 19:56:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:26,465 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 19:56:26,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 19:56:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:26,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:26,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:26,466 INFO L427 AbstractCegarLoop]: === Iteration 1402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2023201947, now seen corresponding path program 1395 times [2020-02-10 19:56:26,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:26,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931862386] [2020-02-10 19:56:26,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:26,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931862386] [2020-02-10 19:56:26,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:26,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:26,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748941812] [2020-02-10 19:56:26,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:26,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:26,815 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 19:56:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:26,945 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-02-10 19:56:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:26,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:26,948 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 19:56:26,948 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 19:56:26,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 19:56:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 783. [2020-02-10 19:56:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:56:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 19:56:26,971 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 19:56:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:26,971 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 19:56:26,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 19:56:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:26,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:26,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:26,973 INFO L427 AbstractCegarLoop]: === Iteration 1403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:26,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1485346369, now seen corresponding path program 1396 times [2020-02-10 19:56:26,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:26,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240904975] [2020-02-10 19:56:26,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:27,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240904975] [2020-02-10 19:56:27,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:27,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062307998] [2020-02-10 19:56:27,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:27,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:27,325 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 19:56:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:27,491 INFO L93 Difference]: Finished difference Result 1229 states and 4304 transitions. [2020-02-10 19:56:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:27,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:27,495 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 19:56:27,495 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 19:56:27,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 19:56:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 778. [2020-02-10 19:56:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 19:56:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3091 transitions. [2020-02-10 19:56:27,516 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3091 transitions. Word has length 25 [2020-02-10 19:56:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:27,517 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3091 transitions. [2020-02-10 19:56:27,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3091 transitions. [2020-02-10 19:56:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:27,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:27,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:27,518 INFO L427 AbstractCegarLoop]: === Iteration 1404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2002195739, now seen corresponding path program 1397 times [2020-02-10 19:56:27,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:27,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260520531] [2020-02-10 19:56:27,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,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 19:56:27,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260520531] [2020-02-10 19:56:27,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:27,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116805346] [2020-02-10 19:56:27,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:27,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:27,883 INFO L87 Difference]: Start difference. First operand 778 states and 3091 transitions. Second operand 10 states. [2020-02-10 19:56:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,051 INFO L93 Difference]: Finished difference Result 1232 states and 4310 transitions. [2020-02-10 19:56:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:28,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,054 INFO L225 Difference]: With dead ends: 1232 [2020-02-10 19:56:28,054 INFO L226 Difference]: Without dead ends: 1216 [2020-02-10 19:56:28,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-02-10 19:56:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 783. [2020-02-10 19:56:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 19:56:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3100 transitions. [2020-02-10 19:56:28,076 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3100 transitions. Word has length 25 [2020-02-10 19:56:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,076 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3100 transitions. [2020-02-10 19:56:28,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3100 transitions. [2020-02-10 19:56:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:28,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:28,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:28,077 INFO L427 AbstractCegarLoop]: === Iteration 1405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash -391254781, now seen corresponding path program 1398 times [2020-02-10 19:56:28,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710510925] [2020-02-10 19:56:28,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:28,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710510925] [2020-02-10 19:56:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:28,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:28,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647008352] [2020-02-10 19:56:28,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:28,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:28,424 INFO L87 Difference]: Start difference. First operand 783 states and 3100 transitions. Second operand 10 states. [2020-02-10 19:56:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,561 INFO L93 Difference]: Finished difference Result 1230 states and 4301 transitions. [2020-02-10 19:56:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:28,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,564 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 19:56:28,564 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:56:28,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:56:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 773. [2020-02-10 19:56:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 19:56:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 19:56:28,586 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 19:56:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,586 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 19:56:28,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 19:56:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:28,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:28,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:28,587 INFO L427 AbstractCegarLoop]: === Iteration 1406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -865663233, now seen corresponding path program 1399 times [2020-02-10 19:56:28,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474354584] [2020-02-10 19:56:28,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:28,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474354584] [2020-02-10 19:56:28,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:28,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:28,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33608842] [2020-02-10 19:56:28,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:28,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:28,922 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 19:56:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:29,091 INFO L93 Difference]: Finished difference Result 1221 states and 4285 transitions. [2020-02-10 19:56:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:29,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:29,095 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 19:56:29,095 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 19:56:29,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 19:56:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-02-10 19:56:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 19:56:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3098 transitions. [2020-02-10 19:56:29,116 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3098 transitions. Word has length 25 [2020-02-10 19:56:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:29,116 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3098 transitions. [2020-02-10 19:56:29,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3098 transitions. [2020-02-10 19:56:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:29,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:29,117 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:29,117 INFO L427 AbstractCegarLoop]: === Iteration 1407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1938748613, now seen corresponding path program 1400 times [2020-02-10 19:56:29,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:29,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477482178] [2020-02-10 19:56:29,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:29,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 19:56:29,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477482178] [2020-02-10 19:56:29,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:29,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:29,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373135183] [2020-02-10 19:56:29,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:29,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:29,464 INFO L87 Difference]: Start difference. First operand 781 states and 3098 transitions. Second operand 10 states. [2020-02-10 19:56:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:29,598 INFO L93 Difference]: Finished difference Result 1222 states and 4281 transitions. [2020-02-10 19:56:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:29,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:29,602 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 19:56:29,602 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 19:56:29,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 19:56:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 775. [2020-02-10 19:56:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 19:56:29,623 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 19:56:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:29,623 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 19:56:29,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 19:56:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:29,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:29,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:29,624 INFO L427 AbstractCegarLoop]: === Iteration 1408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1372009499, now seen corresponding path program 1401 times [2020-02-10 19:56:29,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:29,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739410229] [2020-02-10 19:56:29,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:29,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739410229] [2020-02-10 19:56:29,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:29,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:29,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749971681] [2020-02-10 19:56:29,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:29,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:29,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:29,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:29,956 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 19:56:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:30,090 INFO L93 Difference]: Finished difference Result 1212 states and 4261 transitions. [2020-02-10 19:56:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:30,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:30,093 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 19:56:30,093 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 19:56:30,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 19:56:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 777. [2020-02-10 19:56:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 19:56:30,114 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 19:56:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:30,115 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 19:56:30,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 19:56:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:30,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:30,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:30,116 INFO L427 AbstractCegarLoop]: === Iteration 1409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1907239301, now seen corresponding path program 1402 times [2020-02-10 19:56:30,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:30,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354995722] [2020-02-10 19:56:30,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:30,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354995722] [2020-02-10 19:56:30,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:30,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:30,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670920726] [2020-02-10 19:56:30,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:30,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:30,466 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 19:56:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:30,637 INFO L93 Difference]: Finished difference Result 1208 states and 4251 transitions. [2020-02-10 19:56:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:30,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:30,640 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 19:56:30,640 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 19:56:30,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 19:56:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 775. [2020-02-10 19:56:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 19:56:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 19:56:30,661 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 19:56:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:30,662 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 19:56:30,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 19:56:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:30,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:30,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] [2020-02-10 19:56:30,663 INFO L427 AbstractCegarLoop]: === Iteration 1410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1351003291, now seen corresponding path program 1403 times [2020-02-10 19:56:30,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:30,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990832890] [2020-02-10 19:56:30,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:31,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990832890] [2020-02-10 19:56:31,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:31,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465182313] [2020-02-10 19:56:31,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:31,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:31,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:31,007 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 19:56:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:31,185 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 19:56:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:31,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 19:56:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:31,189 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 19:56:31,189 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 19:56:31,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 19:56:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 19:56:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 19:56:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 19:56:31,210 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 19:56:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:31,210 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 19:56:31,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 19:56:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 19:56:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 19:56:31,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:31,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] [2020-02-10 19:56:31,211 INFO L427 AbstractCegarLoop]: === Iteration 1411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:31,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:31,212 INFO L82 PathProgramCache]: Analyzing trace with hash -813147713, now seen corresponding path program 1404 times [2020-02-10 19:56:31,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:31,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456939285] [2020-02-10 19:56:31,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:31,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456939285] [2020-02-10 19:56:31,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 19:56:31,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900939958] [2020-02-10 19:56:31,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 19:56:31,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 19:56:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 19:56:31,550 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. Received shutdown request... [2020-02-10 19:56:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:56:31,559 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 19:56:31,563 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 19:56:31,564 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:56:31 BasicIcfg [2020-02-10 19:56:31,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:56:31,565 INFO L168 Benchmark]: Toolchain (without parser) took 766248.71 ms. Allocated memory was 139.5 MB in the beginning and 960.0 MB in the end (delta: 820.5 MB). Free memory was 121.4 MB in the beginning and 748.4 MB in the end (delta: -627.0 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,565 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.1 MB in the beginning and 119.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,566 INFO L168 Benchmark]: Boogie Preprocessor took 26.45 ms. Allocated memory is still 139.5 MB. Free memory was 119.4 MB in the beginning and 118.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,566 INFO L168 Benchmark]: RCFGBuilder took 386.99 ms. Allocated memory is still 139.5 MB. Free memory was 118.1 MB in the beginning and 104.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,566 INFO L168 Benchmark]: TraceAbstraction took 765789.91 ms. Allocated memory was 139.5 MB in the beginning and 960.0 MB in the end (delta: 820.5 MB). Free memory was 104.4 MB in the beginning and 748.4 MB in the end (delta: -644.0 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:31,567 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 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.45 ms. Allocated memory is still 139.5 MB. Free memory was 121.1 MB in the beginning and 119.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.45 ms. Allocated memory is still 139.5 MB. Free memory was 119.4 MB in the beginning and 118.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.99 ms. Allocated memory is still 139.5 MB. Free memory was 118.1 MB in the beginning and 104.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 765789.91 ms. Allocated memory was 139.5 MB in the beginning and 960.0 MB in the end (delta: 820.5 MB). Free memory was 104.4 MB in the beginning and 748.4 MB in the end (delta: -644.0 MB). Peak memory consumption was 176.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 68 ProgramPointsBefore, 59 ProgramPointsAfterwards, 99 TransitionsBefore, 90 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 504 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 532 CheckedPairsTotal, 9 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (777states) and FLOYD_HOARE automaton (currently 3 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (2 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 765.4s, OverallIterations: 1411, TraceHistogramMax: 1, AutomataDifference: 205.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 125631 SDtfs, 186199 SDslu, 321611 SDs, 0 SdLazy, 96065 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14060 GetRequests, 1418 SyntacticMatches, 0 SemanticMatches, 12642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8424 ImplicationChecksByTransitivity, 577.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6818occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.6s AutomataMinimizationTime, 1410 MinimizatonAttempts, 729107 StatesRemovedByMinimization, 1403 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 512.1s InterpolantComputationTime, 35275 NumberOfCodeBlocks, 35275 NumberOfCodeBlocksAsserted, 1411 NumberOfCheckSat, 33864 ConstructedInterpolants, 0 QuantifiedInterpolants, 23518944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1411 InterpolantComputations, 1411 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