/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:12:00,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:12:00,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:12:00,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:12:00,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:12:00,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:12:00,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:12:00,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:12:00,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:12:00,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:12:00,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:12:00,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:12:00,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:12:00,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:12:00,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:12:00,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:12:00,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:12:00,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:12:00,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:12:00,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:12:00,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:12:00,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:12:00,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:12:00,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:12:00,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:12:00,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:12:00,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:12:00,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:12:00,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:12:00,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:12:00,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:12:00,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:12:00,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:12:00,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:12:00,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:12:00,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:12:00,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:12:00,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:12:00,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:12:00,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:12:00,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:12:00,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-02-10 20:12:00,677 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:12:00,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:12:00,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:12:00,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:12:00,679 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:12:00,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:12:00,684 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:12:00,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:12:00,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:12:00,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:12:00,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:12:00,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:12:00,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:12:00,685 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:12:00,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:12:00,686 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:12:00,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:12:00,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:12:00,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:12:00,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:12:00,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:12:00,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:00,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:12:00,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:12:00,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:12:00,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:12:00,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:12:00,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:12:00,688 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:12:00,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:12:00,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:12:00,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:12:00,978 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:12:00,979 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:12:00,979 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl [2020-02-10 20:12:00,980 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_5.bpl' [2020-02-10 20:12:01,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:12:01,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:12:01,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:12:01,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:12:01,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:12:01,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:12:01,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:12:01,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:12:01,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:12:01,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:01,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:12:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:12:01,141 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:12:01,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:12:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:12:01,142 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:12:01,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:12:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:12:01,142 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:12:01,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:12:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:12:01,143 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:12:01,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:12:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:12:01,144 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:12:01,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:12:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:12:01,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:12:01,145 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:12:01,311 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:12:01,312 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:12:01,315 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:01 BoogieIcfgContainer [2020-02-10 20:12:01,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:12:01,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:12:01,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:12:01,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:12:01,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/2) ... [2020-02-10 20:12:01,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8762bd and model type example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:12:01, skipping insertion in model container [2020-02-10 20:12:01,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:01" (2/2) ... [2020-02-10 20:12:01,324 INFO L109 eAbstractionObserver]: Analyzing ICFG example_5.bpl [2020-02-10 20:12:01,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:12:01,335 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:12:01,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:12:01,343 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:12:01,575 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-02-10 20:12:01,593 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:12:01,593 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:12:01,593 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:12:01,593 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:12:01,593 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:12:01,594 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:12:01,594 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:12:01,594 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:12:01,608 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 48 transitions [2020-02-10 20:12:01,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 48 transitions [2020-02-10 20:12:01,680 INFO L129 PetriNetUnfolder]: 49/98 cut-off events. [2020-02-10 20:12:01,681 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2020-02-10 20:12:01,689 INFO L76 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 98 events. 49/98 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 321 event pairs. 0/97 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2020-02-10 20:12:01,694 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 48 transitions [2020-02-10 20:12:01,731 INFO L129 PetriNetUnfolder]: 49/98 cut-off events. [2020-02-10 20:12:01,732 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2020-02-10 20:12:01,734 INFO L76 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 98 events. 49/98 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 321 event pairs. 0/97 useless extension candidates. Maximal degree in co-relation 86. Up to 30 conditions per place. [2020-02-10 20:12:01,736 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 440 [2020-02-10 20:12:01,738 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 20:12:01,863 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130 [2020-02-10 20:12:01,864 INFO L214 etLargeBlockEncoding]: Total number of compositions: 6 [2020-02-10 20:12:01,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 42 transitions [2020-02-10 20:12:01,899 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 276 states. [2020-02-10 20:12:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2020-02-10 20:12:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:01,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:01,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:01,920 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 543435427, now seen corresponding path program 1 times [2020-02-10 20:12:01,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:01,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931523338] [2020-02-10 20:12:01,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,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 20:12:02,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931523338] [2020-02-10 20:12:02,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:02,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955589462] [2020-02-10 20:12:02,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:02,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,119 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 3 states. [2020-02-10 20:12:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:02,170 INFO L93 Difference]: Finished difference Result 228 states and 684 transitions. [2020-02-10 20:12:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:02,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:12:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:02,190 INFO L225 Difference]: With dead ends: 228 [2020-02-10 20:12:02,191 INFO L226 Difference]: Without dead ends: 227 [2020-02-10 20:12:02,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-02-10 20:12:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2020-02-10 20:12:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-02-10 20:12:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 683 transitions. [2020-02-10 20:12:02,275 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 683 transitions. Word has length 16 [2020-02-10 20:12:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:02,276 INFO L479 AbstractCegarLoop]: Abstraction has 227 states and 683 transitions. [2020-02-10 20:12:02,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 683 transitions. [2020-02-10 20:12:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:02,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:02,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:02,281 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash 867723203, now seen corresponding path program 1 times [2020-02-10 20:12:02,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:02,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560863529] [2020-02-10 20:12:02,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:02,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560863529] [2020-02-10 20:12:02,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:02,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934460158] [2020-02-10 20:12:02,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:02,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:02,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,320 INFO L87 Difference]: Start difference. First operand 227 states and 683 transitions. Second operand 3 states. [2020-02-10 20:12:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:02,350 INFO L93 Difference]: Finished difference Result 211 states and 611 transitions. [2020-02-10 20:12:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:02,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:12:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:02,353 INFO L225 Difference]: With dead ends: 211 [2020-02-10 20:12:02,354 INFO L226 Difference]: Without dead ends: 211 [2020-02-10 20:12:02,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-02-10 20:12:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-02-10 20:12:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-02-10 20:12:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 611 transitions. [2020-02-10 20:12:02,392 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 611 transitions. Word has length 16 [2020-02-10 20:12:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:02,392 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 611 transitions. [2020-02-10 20:12:02,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 611 transitions. [2020-02-10 20:12:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:02,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:02,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:02,396 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1800356309, now seen corresponding path program 1 times [2020-02-10 20:12:02,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:02,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292829482] [2020-02-10 20:12:02,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:02,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292829482] [2020-02-10 20:12:02,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:02,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076661487] [2020-02-10 20:12:02,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:02,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,423 INFO L87 Difference]: Start difference. First operand 211 states and 611 transitions. Second operand 3 states. [2020-02-10 20:12:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:02,439 INFO L93 Difference]: Finished difference Result 147 states and 391 transitions. [2020-02-10 20:12:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:02,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:12:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:02,442 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:12:02,442 INFO L226 Difference]: Without dead ends: 147 [2020-02-10 20:12:02,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-02-10 20:12:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-02-10 20:12:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-02-10 20:12:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 391 transitions. [2020-02-10 20:12:02,455 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 391 transitions. Word has length 16 [2020-02-10 20:12:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:02,456 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 391 transitions. [2020-02-10 20:12:02,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 391 transitions. [2020-02-10 20:12:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:02,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:02,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:02,458 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash 536228197, now seen corresponding path program 1 times [2020-02-10 20:12:02,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:02,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577788115] [2020-02-10 20:12:02,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:02,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577788115] [2020-02-10 20:12:02,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:02,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829702064] [2020-02-10 20:12:02,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:02,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,500 INFO L87 Difference]: Start difference. First operand 147 states and 391 transitions. Second operand 3 states. [2020-02-10 20:12:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:02,517 INFO L93 Difference]: Finished difference Result 95 states and 241 transitions. [2020-02-10 20:12:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:02,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-02-10 20:12:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:02,519 INFO L225 Difference]: With dead ends: 95 [2020-02-10 20:12:02,519 INFO L226 Difference]: Without dead ends: 95 [2020-02-10 20:12:02,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-02-10 20:12:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-02-10 20:12:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:12:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-02-10 20:12:02,538 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 16 [2020-02-10 20:12:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:02,538 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-02-10 20:12:02,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-02-10 20:12:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:02,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:02,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:02,540 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1934968637, now seen corresponding path program 1 times [2020-02-10 20:12:02,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:02,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145932357] [2020-02-10 20:12:02,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:02,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145932357] [2020-02-10 20:12:02,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899482856] [2020-02-10 20:12:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:02,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:02,933 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 7 states. [2020-02-10 20:12:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,028 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-02-10 20:12:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:03,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,030 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:12:03,031 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:12:03,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:12:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2020-02-10 20:12:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-02-10 20:12:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 252 transitions. [2020-02-10 20:12:03,047 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 252 transitions. Word has length 16 [2020-02-10 20:12:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,048 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 252 transitions. [2020-02-10 20:12:03,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 252 transitions. [2020-02-10 20:12:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:03,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:03,050 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1391533921, now seen corresponding path program 2 times [2020-02-10 20:12:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868066237] [2020-02-10 20:12:03,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868066237] [2020-02-10 20:12:03,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:03,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265336849] [2020-02-10 20:12:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:03,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:03,385 INFO L87 Difference]: Start difference. First operand 100 states and 252 transitions. Second operand 7 states. [2020-02-10 20:12:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,460 INFO L93 Difference]: Finished difference Result 160 states and 334 transitions. [2020-02-10 20:12:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:03,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,464 INFO L225 Difference]: With dead ends: 160 [2020-02-10 20:12:03,464 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 20:12:03,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 20:12:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2020-02-10 20:12:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:12:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-02-10 20:12:03,472 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 16 [2020-02-10 20:12:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,472 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-02-10 20:12:03,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-02-10 20:12:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:03,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:03,479 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash -870593663, now seen corresponding path program 3 times [2020-02-10 20:12:03,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710301937] [2020-02-10 20:12:03,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:03,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710301937] [2020-02-10 20:12:03,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:03,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:03,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384883735] [2020-02-10 20:12:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:03,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:03,749 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 7 states. [2020-02-10 20:12:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:03,819 INFO L93 Difference]: Finished difference Result 152 states and 319 transitions. [2020-02-10 20:12:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:03,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:03,821 INFO L225 Difference]: With dead ends: 152 [2020-02-10 20:12:03,821 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:12:03,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:12:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2020-02-10 20:12:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:12:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 248 transitions. [2020-02-10 20:12:03,830 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 248 transitions. Word has length 16 [2020-02-10 20:12:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:03,831 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 248 transitions. [2020-02-10 20:12:03,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 248 transitions. [2020-02-10 20:12:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:03,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:03,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:03,833 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2071878669, now seen corresponding path program 4 times [2020-02-10 20:12:03,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:03,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264832547] [2020-02-10 20:12:03,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,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 20:12:04,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264832547] [2020-02-10 20:12:04,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:04,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082252418] [2020-02-10 20:12:04,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:04,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:04,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:04,028 INFO L87 Difference]: Start difference. First operand 99 states and 248 transitions. Second operand 7 states. [2020-02-10 20:12:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,115 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-02-10 20:12:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:04,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,117 INFO L225 Difference]: With dead ends: 155 [2020-02-10 20:12:04,117 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:12:04,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:12:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2020-02-10 20:12:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:12:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 246 transitions. [2020-02-10 20:12:04,124 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 246 transitions. Word has length 16 [2020-02-10 20:12:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,125 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 246 transitions. [2020-02-10 20:12:04,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 246 transitions. [2020-02-10 20:12:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:04,126 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:04,126 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1881104299, now seen corresponding path program 5 times [2020-02-10 20:12:04,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863957257] [2020-02-10 20:12:04,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:04,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863957257] [2020-02-10 20:12:04,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721928975] [2020-02-10 20:12:04,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:04,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:04,369 INFO L87 Difference]: Start difference. First operand 98 states and 246 transitions. Second operand 7 states. [2020-02-10 20:12:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,425 INFO L93 Difference]: Finished difference Result 167 states and 348 transitions. [2020-02-10 20:12:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:04,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,427 INFO L225 Difference]: With dead ends: 167 [2020-02-10 20:12:04,427 INFO L226 Difference]: Without dead ends: 155 [2020-02-10 20:12:04,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-02-10 20:12:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104. [2020-02-10 20:12:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 20:12:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 255 transitions. [2020-02-10 20:12:04,433 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 255 transitions. Word has length 16 [2020-02-10 20:12:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,433 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 255 transitions. [2020-02-10 20:12:04,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 255 transitions. [2020-02-10 20:12:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:04,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:04,435 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1878970879, now seen corresponding path program 6 times [2020-02-10 20:12:04,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915181104] [2020-02-10 20:12:04,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:04,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915181104] [2020-02-10 20:12:04,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:04,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729449601] [2020-02-10 20:12:04,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:04,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:04,659 INFO L87 Difference]: Start difference. First operand 104 states and 255 transitions. Second operand 7 states. [2020-02-10 20:12:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,842 INFO L93 Difference]: Finished difference Result 165 states and 340 transitions. [2020-02-10 20:12:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:04,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,846 INFO L225 Difference]: With dead ends: 165 [2020-02-10 20:12:04,846 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 20:12:04,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 20:12:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2020-02-10 20:12:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:12:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-02-10 20:12:04,853 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 16 [2020-02-10 20:12:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:04,853 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-02-10 20:12:04,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-02-10 20:12:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:04,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:04,855 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1274477111, now seen corresponding path program 7 times [2020-02-10 20:12:04,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586550351] [2020-02-10 20:12:04,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,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 20:12:05,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586550351] [2020-02-10 20:12:05,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:05,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278907957] [2020-02-10 20:12:05,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:05,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:05,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:05,030 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 7 states. [2020-02-10 20:12:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,089 INFO L93 Difference]: Finished difference Result 151 states and 315 transitions. [2020-02-10 20:12:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:05,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,091 INFO L225 Difference]: With dead ends: 151 [2020-02-10 20:12:05,091 INFO L226 Difference]: Without dead ends: 144 [2020-02-10 20:12:05,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-02-10 20:12:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 99. [2020-02-10 20:12:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:12:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 247 transitions. [2020-02-10 20:12:05,096 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 247 transitions. Word has length 16 [2020-02-10 20:12:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,097 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 247 transitions. [2020-02-10 20:12:05,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 247 transitions. [2020-02-10 20:12:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:05,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,098 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1817911827, now seen corresponding path program 8 times [2020-02-10 20:12:05,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404867888] [2020-02-10 20:12:05,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404867888] [2020-02-10 20:12:05,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:05,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729684811] [2020-02-10 20:12:05,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:05,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:05,262 INFO L87 Difference]: Start difference. First operand 99 states and 247 transitions. Second operand 7 states. [2020-02-10 20:12:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,313 INFO L93 Difference]: Finished difference Result 156 states and 323 transitions. [2020-02-10 20:12:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:05,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,316 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:12:05,316 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:12:05,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:12:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 97. [2020-02-10 20:12:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:12:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-02-10 20:12:05,321 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 16 [2020-02-10 20:12:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,321 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-02-10 20:12:05,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-02-10 20:12:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:05,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,323 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1531085189, now seen corresponding path program 9 times [2020-02-10 20:12:05,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163982176] [2020-02-10 20:12:05,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163982176] [2020-02-10 20:12:05,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:05,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548043492] [2020-02-10 20:12:05,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:05,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:05,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:05,489 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 7 states. [2020-02-10 20:12:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,535 INFO L93 Difference]: Finished difference Result 147 states and 306 transitions. [2020-02-10 20:12:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:05,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,537 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:12:05,537 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:12:05,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:12:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2020-02-10 20:12:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:12:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 243 transitions. [2020-02-10 20:12:05,542 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 243 transitions. Word has length 16 [2020-02-10 20:12:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,543 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 243 transitions. [2020-02-10 20:12:05,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 243 transitions. [2020-02-10 20:12:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:05,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,544 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash 675778535, now seen corresponding path program 10 times [2020-02-10 20:12:05,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388233408] [2020-02-10 20:12:05,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388233408] [2020-02-10 20:12:05,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:05,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114068378] [2020-02-10 20:12:05,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:05,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:05,693 INFO L87 Difference]: Start difference. First operand 98 states and 243 transitions. Second operand 7 states. [2020-02-10 20:12:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,748 INFO L93 Difference]: Finished difference Result 149 states and 309 transitions. [2020-02-10 20:12:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:05,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,751 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:12:05,751 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:12:05,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:12:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2020-02-10 20:12:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:12:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-02-10 20:12:05,755 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 16 [2020-02-10 20:12:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,756 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-02-10 20:12:05,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-02-10 20:12:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:05,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,757 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1732352971, now seen corresponding path program 11 times [2020-02-10 20:12:05,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107051633] [2020-02-10 20:12:05,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:05,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107051633] [2020-02-10 20:12:05,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:05,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111082863] [2020-02-10 20:12:05,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:05,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:05,903 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 7 states. [2020-02-10 20:12:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:05,957 INFO L93 Difference]: Finished difference Result 160 states and 331 transitions. [2020-02-10 20:12:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:05,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:05,958 INFO L225 Difference]: With dead ends: 160 [2020-02-10 20:12:05,958 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:12:05,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:12:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 101. [2020-02-10 20:12:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 20:12:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 247 transitions. [2020-02-10 20:12:05,964 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 247 transitions. Word has length 16 [2020-02-10 20:12:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,964 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 247 transitions. [2020-02-10 20:12:05,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 247 transitions. [2020-02-10 20:12:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:05,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,965 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1636870967, now seen corresponding path program 12 times [2020-02-10 20:12:05,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353273334] [2020-02-10 20:12:05,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353273334] [2020-02-10 20:12:06,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:06,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939815512] [2020-02-10 20:12:06,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:06,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:06,103 INFO L87 Difference]: Start difference. First operand 101 states and 247 transitions. Second operand 7 states. [2020-02-10 20:12:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,174 INFO L93 Difference]: Finished difference Result 157 states and 322 transitions. [2020-02-10 20:12:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:06,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,176 INFO L225 Difference]: With dead ends: 157 [2020-02-10 20:12:06,176 INFO L226 Difference]: Without dead ends: 142 [2020-02-10 20:12:06,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-02-10 20:12:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2020-02-10 20:12:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:12:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 236 transitions. [2020-02-10 20:12:06,181 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 236 transitions. Word has length 16 [2020-02-10 20:12:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,181 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 236 transitions. [2020-02-10 20:12:06,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 236 transitions. [2020-02-10 20:12:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:06,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:06,182 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash -858157495, now seen corresponding path program 13 times [2020-02-10 20:12:06,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445725313] [2020-02-10 20:12:06,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445725313] [2020-02-10 20:12:06,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:06,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935742621] [2020-02-10 20:12:06,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:06,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:06,348 INFO L87 Difference]: Start difference. First operand 95 states and 236 transitions. Second operand 7 states. [2020-02-10 20:12:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,419 INFO L93 Difference]: Finished difference Result 143 states and 298 transitions. [2020-02-10 20:12:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:06,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,421 INFO L225 Difference]: With dead ends: 143 [2020-02-10 20:12:06,421 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:12:06,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:12:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2020-02-10 20:12:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:12:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 240 transitions. [2020-02-10 20:12:06,427 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 240 transitions. Word has length 16 [2020-02-10 20:12:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,428 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 240 transitions. [2020-02-10 20:12:06,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 240 transitions. [2020-02-10 20:12:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:06,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:06,429 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2084314837, now seen corresponding path program 14 times [2020-02-10 20:12:06,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560642791] [2020-02-10 20:12:06,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560642791] [2020-02-10 20:12:06,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:06,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588385469] [2020-02-10 20:12:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:06,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:06,597 INFO L87 Difference]: Start difference. First operand 97 states and 240 transitions. Second operand 7 states. [2020-02-10 20:12:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,679 INFO L93 Difference]: Finished difference Result 146 states and 303 transitions. [2020-02-10 20:12:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:06,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,681 INFO L225 Difference]: With dead ends: 146 [2020-02-10 20:12:06,681 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:12:06,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:12:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2020-02-10 20:12:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-02-10 20:12:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 238 transitions. [2020-02-10 20:12:06,685 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 238 transitions. Word has length 16 [2020-02-10 20:12:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,685 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 238 transitions. [2020-02-10 20:12:06,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 238 transitions. [2020-02-10 20:12:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:06,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:06,686 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash 457999809, now seen corresponding path program 15 times [2020-02-10 20:12:06,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610466048] [2020-02-10 20:12:06,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:06,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610466048] [2020-02-10 20:12:06,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:06,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660811956] [2020-02-10 20:12:06,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:06,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:06,839 INFO L87 Difference]: Start difference. First operand 96 states and 238 transitions. Second operand 7 states. [2020-02-10 20:12:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,903 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2020-02-10 20:12:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:06,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,905 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:12:06,905 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:12:06,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:12:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2020-02-10 20:12:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:12:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 239 transitions. [2020-02-10 20:12:06,909 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 239 transitions. Word has length 16 [2020-02-10 20:12:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,910 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 239 transitions. [2020-02-10 20:12:06,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 239 transitions. [2020-02-10 20:12:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:06,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:06,911 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash -397306845, now seen corresponding path program 16 times [2020-02-10 20:12:06,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050445977] [2020-02-10 20:12:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050445977] [2020-02-10 20:12:07,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:07,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637732403] [2020-02-10 20:12:07,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:07,044 INFO L87 Difference]: Start difference. First operand 97 states and 239 transitions. Second operand 7 states. [2020-02-10 20:12:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,106 INFO L93 Difference]: Finished difference Result 144 states and 298 transitions. [2020-02-10 20:12:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:07,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,107 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:12:07,108 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:12:07,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:12:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-02-10 20:12:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-02-10 20:12:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 237 transitions. [2020-02-10 20:12:07,113 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 237 transitions. Word has length 16 [2020-02-10 20:12:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,113 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 237 transitions. [2020-02-10 20:12:07,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 237 transitions. [2020-02-10 20:12:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:07,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,114 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1339612339, now seen corresponding path program 17 times [2020-02-10 20:12:07,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655727720] [2020-02-10 20:12:07,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655727720] [2020-02-10 20:12:07,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:07,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752582754] [2020-02-10 20:12:07,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:07,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:07,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:07,252 INFO L87 Difference]: Start difference. First operand 96 states and 237 transitions. Second operand 7 states. [2020-02-10 20:12:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,315 INFO L93 Difference]: Finished difference Result 150 states and 312 transitions. [2020-02-10 20:12:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:07,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,317 INFO L225 Difference]: With dead ends: 150 [2020-02-10 20:12:07,317 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:12:07,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:12:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2020-02-10 20:12:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-02-10 20:12:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2020-02-10 20:12:07,322 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 16 [2020-02-10 20:12:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,322 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2020-02-10 20:12:07,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2020-02-10 20:12:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:07,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,323 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2087156279, now seen corresponding path program 18 times [2020-02-10 20:12:07,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941365457] [2020-02-10 20:12:07,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941365457] [2020-02-10 20:12:07,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:07,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952627606] [2020-02-10 20:12:07,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:07,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:07,629 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand 7 states. [2020-02-10 20:12:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,690 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-02-10 20:12:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:07,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,692 INFO L225 Difference]: With dead ends: 149 [2020-02-10 20:12:07,692 INFO L226 Difference]: Without dead ends: 136 [2020-02-10 20:12:07,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-02-10 20:12:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2020-02-10 20:12:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:12:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 235 transitions. [2020-02-10 20:12:07,696 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 235 transitions. Word has length 16 [2020-02-10 20:12:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,696 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 235 transitions. [2020-02-10 20:12:07,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 235 transitions. [2020-02-10 20:12:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:07,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,698 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,698 INFO L82 PathProgramCache]: Analyzing trace with hash -257727173, now seen corresponding path program 19 times [2020-02-10 20:12:07,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785385296] [2020-02-10 20:12:07,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785385296] [2020-02-10 20:12:07,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:07,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694081790] [2020-02-10 20:12:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:07,872 INFO L87 Difference]: Start difference. First operand 95 states and 235 transitions. Second operand 7 states. [2020-02-10 20:12:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,936 INFO L93 Difference]: Finished difference Result 176 states and 370 transitions. [2020-02-10 20:12:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:07,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,938 INFO L225 Difference]: With dead ends: 176 [2020-02-10 20:12:07,938 INFO L226 Difference]: Without dead ends: 164 [2020-02-10 20:12:07,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-02-10 20:12:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2020-02-10 20:12:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-02-10 20:12:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 261 transitions. [2020-02-10 20:12:07,943 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 261 transitions. Word has length 16 [2020-02-10 20:12:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,944 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 261 transitions. [2020-02-10 20:12:07,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 261 transitions. [2020-02-10 20:12:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:07,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,945 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash -255593753, now seen corresponding path program 20 times [2020-02-10 20:12:07,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863556021] [2020-02-10 20:12:07,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863556021] [2020-02-10 20:12:08,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:08,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617243708] [2020-02-10 20:12:08,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:08,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:08,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:08,086 INFO L87 Difference]: Start difference. First operand 107 states and 261 transitions. Second operand 7 states. [2020-02-10 20:12:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,145 INFO L93 Difference]: Finished difference Result 174 states and 362 transitions. [2020-02-10 20:12:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:08,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,147 INFO L225 Difference]: With dead ends: 174 [2020-02-10 20:12:08,147 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:12:08,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:12:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2020-02-10 20:12:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 20:12:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 247 transitions. [2020-02-10 20:12:08,152 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 247 transitions. Word has length 16 [2020-02-10 20:12:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,155 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 247 transitions. [2020-02-10 20:12:08,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 247 transitions. [2020-02-10 20:12:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:08,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,156 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 886628069, now seen corresponding path program 21 times [2020-02-10 20:12:08,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429818080] [2020-02-10 20:12:08,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429818080] [2020-02-10 20:12:08,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:08,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698497309] [2020-02-10 20:12:08,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:08,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:08,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:08,328 INFO L87 Difference]: Start difference. First operand 101 states and 247 transitions. Second operand 7 states. [2020-02-10 20:12:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,379 INFO L93 Difference]: Finished difference Result 173 states and 359 transitions. [2020-02-10 20:12:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:08,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,381 INFO L225 Difference]: With dead ends: 173 [2020-02-10 20:12:08,381 INFO L226 Difference]: Without dead ends: 161 [2020-02-10 20:12:08,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-02-10 20:12:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2020-02-10 20:12:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-02-10 20:12:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 253 transitions. [2020-02-10 20:12:08,386 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 253 transitions. Word has length 16 [2020-02-10 20:12:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,387 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 253 transitions. [2020-02-10 20:12:08,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 253 transitions. [2020-02-10 20:12:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:08,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,388 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 847649909, now seen corresponding path program 22 times [2020-02-10 20:12:08,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96162206] [2020-02-10 20:12:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96162206] [2020-02-10 20:12:08,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:08,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319209519] [2020-02-10 20:12:08,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:08,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:08,546 INFO L87 Difference]: Start difference. First operand 105 states and 253 transitions. Second operand 7 states. [2020-02-10 20:12:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,601 INFO L93 Difference]: Finished difference Result 170 states and 350 transitions. [2020-02-10 20:12:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:08,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,603 INFO L225 Difference]: With dead ends: 170 [2020-02-10 20:12:08,603 INFO L226 Difference]: Without dead ends: 157 [2020-02-10 20:12:08,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-02-10 20:12:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2020-02-10 20:12:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-02-10 20:12:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 243 transitions. [2020-02-10 20:12:08,609 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 243 transitions. Word has length 16 [2020-02-10 20:12:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,609 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 243 transitions. [2020-02-10 20:12:08,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 243 transitions. [2020-02-10 20:12:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:08,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,610 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1633045487, now seen corresponding path program 23 times [2020-02-10 20:12:08,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633544400] [2020-02-10 20:12:08,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633544400] [2020-02-10 20:12:08,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:08,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111454504] [2020-02-10 20:12:08,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:08,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:08,751 INFO L87 Difference]: Start difference. First operand 101 states and 243 transitions. Second operand 7 states. [2020-02-10 20:12:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,803 INFO L93 Difference]: Finished difference Result 168 states and 347 transitions. [2020-02-10 20:12:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:08,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,804 INFO L225 Difference]: With dead ends: 168 [2020-02-10 20:12:08,804 INFO L226 Difference]: Without dead ends: 158 [2020-02-10 20:12:08,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-02-10 20:12:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 104. [2020-02-10 20:12:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-02-10 20:12:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 248 transitions. [2020-02-10 20:12:08,809 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 248 transitions. Word has length 16 [2020-02-10 20:12:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,809 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 248 transitions. [2020-02-10 20:12:08,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 248 transitions. [2020-02-10 20:12:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:08,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,810 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1729568327, now seen corresponding path program 24 times [2020-02-10 20:12:08,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592092701] [2020-02-10 20:12:08,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592092701] [2020-02-10 20:12:08,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:08,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779633756] [2020-02-10 20:12:08,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:08,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:08,961 INFO L87 Difference]: Start difference. First operand 104 states and 248 transitions. Second operand 7 states. [2020-02-10 20:12:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,022 INFO L93 Difference]: Finished difference Result 167 states and 342 transitions. [2020-02-10 20:12:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:09,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,024 INFO L225 Difference]: With dead ends: 167 [2020-02-10 20:12:09,024 INFO L226 Difference]: Without dead ends: 145 [2020-02-10 20:12:09,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-02-10 20:12:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 91. [2020-02-10 20:12:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:12:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 224 transitions. [2020-02-10 20:12:09,028 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 224 transitions. Word has length 16 [2020-02-10 20:12:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,028 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 224 transitions. [2020-02-10 20:12:09,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 224 transitions. [2020-02-10 20:12:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:09,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,029 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1892241251, now seen corresponding path program 25 times [2020-02-10 20:12:09,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498470413] [2020-02-10 20:12:09,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498470413] [2020-02-10 20:12:09,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:09,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258954996] [2020-02-10 20:12:09,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:09,177 INFO L87 Difference]: Start difference. First operand 91 states and 224 transitions. Second operand 7 states. [2020-02-10 20:12:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,247 INFO L93 Difference]: Finished difference Result 148 states and 301 transitions. [2020-02-10 20:12:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:09,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,249 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:12:09,249 INFO L226 Difference]: Without dead ends: 141 [2020-02-10 20:12:09,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-02-10 20:12:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-02-10 20:12:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:12:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 227 transitions. [2020-02-10 20:12:09,253 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 227 transitions. Word has length 16 [2020-02-10 20:12:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,253 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 227 transitions. [2020-02-10 20:12:09,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 227 transitions. [2020-02-10 20:12:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:09,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,254 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1348806535, now seen corresponding path program 26 times [2020-02-10 20:12:09,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189632082] [2020-02-10 20:12:09,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189632082] [2020-02-10 20:12:09,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:09,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035240097] [2020-02-10 20:12:09,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:09,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:09,403 INFO L87 Difference]: Start difference. First operand 93 states and 227 transitions. Second operand 7 states. [2020-02-10 20:12:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,446 INFO L93 Difference]: Finished difference Result 153 states and 309 transitions. [2020-02-10 20:12:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:09,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,448 INFO L225 Difference]: With dead ends: 153 [2020-02-10 20:12:09,448 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:12:09,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:12:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 91. [2020-02-10 20:12:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:12:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 222 transitions. [2020-02-10 20:12:09,452 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 222 transitions. Word has length 16 [2020-02-10 20:12:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,452 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 222 transitions. [2020-02-10 20:12:09,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 222 transitions. [2020-02-10 20:12:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:09,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,454 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash -913321049, now seen corresponding path program 27 times [2020-02-10 20:12:09,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606552869] [2020-02-10 20:12:09,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606552869] [2020-02-10 20:12:09,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:09,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958436657] [2020-02-10 20:12:09,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:09,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:09,612 INFO L87 Difference]: Start difference. First operand 91 states and 222 transitions. Second operand 7 states. [2020-02-10 20:12:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,661 INFO L93 Difference]: Finished difference Result 145 states and 294 transitions. [2020-02-10 20:12:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:09,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,663 INFO L225 Difference]: With dead ends: 145 [2020-02-10 20:12:09,663 INFO L226 Difference]: Without dead ends: 138 [2020-02-10 20:12:09,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-02-10 20:12:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2020-02-10 20:12:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:12:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 223 transitions. [2020-02-10 20:12:09,669 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 223 transitions. Word has length 16 [2020-02-10 20:12:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,669 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 223 transitions. [2020-02-10 20:12:09,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 223 transitions. [2020-02-10 20:12:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:09,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,670 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,670 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2029151283, now seen corresponding path program 28 times [2020-02-10 20:12:09,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733211057] [2020-02-10 20:12:09,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:09,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733211057] [2020-02-10 20:12:09,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:09,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053486169] [2020-02-10 20:12:09,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:09,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:09,824 INFO L87 Difference]: Start difference. First operand 92 states and 223 transitions. Second operand 7 states. [2020-02-10 20:12:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,882 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-02-10 20:12:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:09,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,884 INFO L225 Difference]: With dead ends: 148 [2020-02-10 20:12:09,885 INFO L226 Difference]: Without dead ends: 137 [2020-02-10 20:12:09,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-02-10 20:12:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-02-10 20:12:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:12:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 221 transitions. [2020-02-10 20:12:09,890 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 221 transitions. Word has length 16 [2020-02-10 20:12:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,890 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 221 transitions. [2020-02-10 20:12:09,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 221 transitions. [2020-02-10 20:12:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:09,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:09,891 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1923831685, now seen corresponding path program 29 times [2020-02-10 20:12:09,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807949741] [2020-02-10 20:12:09,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807949741] [2020-02-10 20:12:10,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:10,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207940874] [2020-02-10 20:12:10,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:10,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:10,062 INFO L87 Difference]: Start difference. First operand 91 states and 221 transitions. Second operand 7 states. [2020-02-10 20:12:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,107 INFO L93 Difference]: Finished difference Result 160 states and 323 transitions. [2020-02-10 20:12:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:10,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,108 INFO L225 Difference]: With dead ends: 160 [2020-02-10 20:12:10,109 INFO L226 Difference]: Without dead ends: 148 [2020-02-10 20:12:10,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-02-10 20:12:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 97. [2020-02-10 20:12:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-02-10 20:12:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 230 transitions. [2020-02-10 20:12:10,113 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 230 transitions. Word has length 16 [2020-02-10 20:12:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,113 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 230 transitions. [2020-02-10 20:12:10,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 230 transitions. [2020-02-10 20:12:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:10,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:10,114 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1921698265, now seen corresponding path program 30 times [2020-02-10 20:12:10,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108588937] [2020-02-10 20:12:10,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108588937] [2020-02-10 20:12:10,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:10,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025513719] [2020-02-10 20:12:10,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:10,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:10,266 INFO L87 Difference]: Start difference. First operand 97 states and 230 transitions. Second operand 7 states. [2020-02-10 20:12:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,335 INFO L93 Difference]: Finished difference Result 158 states and 315 transitions. [2020-02-10 20:12:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:10,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,336 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:12:10,337 INFO L226 Difference]: Without dead ends: 139 [2020-02-10 20:12:10,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-02-10 20:12:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 88. [2020-02-10 20:12:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:12:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 213 transitions. [2020-02-10 20:12:10,342 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 213 transitions. Word has length 16 [2020-02-10 20:12:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,343 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 213 transitions. [2020-02-10 20:12:10,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 213 transitions. [2020-02-10 20:12:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:10,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:10,344 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash -224453179, now seen corresponding path program 31 times [2020-02-10 20:12:10,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115445275] [2020-02-10 20:12:10,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115445275] [2020-02-10 20:12:10,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:10,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162859598] [2020-02-10 20:12:10,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:10,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:10,500 INFO L87 Difference]: Start difference. First operand 88 states and 213 transitions. Second operand 7 states. [2020-02-10 20:12:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,543 INFO L93 Difference]: Finished difference Result 140 states and 281 transitions. [2020-02-10 20:12:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:10,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,545 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:12:10,545 INFO L226 Difference]: Without dead ends: 133 [2020-02-10 20:12:10,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-02-10 20:12:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2020-02-10 20:12:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:12:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 222 transitions. [2020-02-10 20:12:10,550 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 222 transitions. Word has length 16 [2020-02-10 20:12:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,550 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 222 transitions. [2020-02-10 20:12:10,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 222 transitions. [2020-02-10 20:12:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:10,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:10,552 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash -767887895, now seen corresponding path program 32 times [2020-02-10 20:12:10,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815023619] [2020-02-10 20:12:10,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815023619] [2020-02-10 20:12:10,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:10,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350481814] [2020-02-10 20:12:10,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:10,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:10,717 INFO L87 Difference]: Start difference. First operand 92 states and 222 transitions. Second operand 7 states. [2020-02-10 20:12:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,779 INFO L93 Difference]: Finished difference Result 145 states and 289 transitions. [2020-02-10 20:12:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:10,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,781 INFO L225 Difference]: With dead ends: 145 [2020-02-10 20:12:10,781 INFO L226 Difference]: Without dead ends: 131 [2020-02-10 20:12:10,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-02-10 20:12:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2020-02-10 20:12:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:12:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 217 transitions. [2020-02-10 20:12:10,785 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 217 transitions. Word has length 16 [2020-02-10 20:12:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,785 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 217 transitions. [2020-02-10 20:12:10,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 217 transitions. [2020-02-10 20:12:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:10,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:10,787 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2009654315, now seen corresponding path program 33 times [2020-02-10 20:12:10,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812157247] [2020-02-10 20:12:10,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,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 20:12:10,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812157247] [2020-02-10 20:12:10,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:10,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633657382] [2020-02-10 20:12:10,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:10,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:10,970 INFO L87 Difference]: Start difference. First operand 90 states and 217 transitions. Second operand 7 states. [2020-02-10 20:12:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,011 INFO L93 Difference]: Finished difference Result 134 states and 269 transitions. [2020-02-10 20:12:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:11,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,013 INFO L225 Difference]: With dead ends: 134 [2020-02-10 20:12:11,013 INFO L226 Difference]: Without dead ends: 127 [2020-02-10 20:12:11,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-02-10 20:12:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2020-02-10 20:12:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:12:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 218 transitions. [2020-02-10 20:12:11,017 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 218 transitions. Word has length 16 [2020-02-10 20:12:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,017 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 218 transitions. [2020-02-10 20:12:11,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 218 transitions. [2020-02-10 20:12:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:11,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,019 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1438331371, now seen corresponding path program 34 times [2020-02-10 20:12:11,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713345420] [2020-02-10 20:12:11,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:11,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713345420] [2020-02-10 20:12:11,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:11,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447067583] [2020-02-10 20:12:11,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:11,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:11,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:11,170 INFO L87 Difference]: Start difference. First operand 91 states and 218 transitions. Second operand 7 states. [2020-02-10 20:12:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,231 INFO L93 Difference]: Finished difference Result 128 states and 264 transitions. [2020-02-10 20:12:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:11,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,232 INFO L225 Difference]: With dead ends: 128 [2020-02-10 20:12:11,233 INFO L226 Difference]: Without dead ends: 119 [2020-02-10 20:12:11,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-02-10 20:12:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2020-02-10 20:12:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:12:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 216 transitions. [2020-02-10 20:12:11,236 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 216 transitions. Word has length 16 [2020-02-10 20:12:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,236 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 216 transitions. [2020-02-10 20:12:11,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 216 transitions. [2020-02-10 20:12:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:11,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,238 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash -281261761, now seen corresponding path program 35 times [2020-02-10 20:12:11,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161779232] [2020-02-10 20:12:11,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161779232] [2020-02-10 20:12:11,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:11,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509585934] [2020-02-10 20:12:11,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:11,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:11,399 INFO L87 Difference]: Start difference. First operand 90 states and 216 transitions. Second operand 7 states. [2020-02-10 20:12:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,459 INFO L93 Difference]: Finished difference Result 141 states and 282 transitions. [2020-02-10 20:12:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:11,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,460 INFO L225 Difference]: With dead ends: 141 [2020-02-10 20:12:11,460 INFO L226 Difference]: Without dead ends: 129 [2020-02-10 20:12:11,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-02-10 20:12:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2020-02-10 20:12:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-02-10 20:12:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 220 transitions. [2020-02-10 20:12:11,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 220 transitions. Word has length 16 [2020-02-10 20:12:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,466 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 220 transitions. [2020-02-10 20:12:11,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 220 transitions. [2020-02-10 20:12:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:11,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,468 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1456765397, now seen corresponding path program 36 times [2020-02-10 20:12:11,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504796926] [2020-02-10 20:12:11,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504796926] [2020-02-10 20:12:11,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:11,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711230779] [2020-02-10 20:12:11,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:11,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:11,627 INFO L87 Difference]: Start difference. First operand 93 states and 220 transitions. Second operand 7 states. [2020-02-10 20:12:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,684 INFO L93 Difference]: Finished difference Result 130 states and 266 transitions. [2020-02-10 20:12:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:11,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,685 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:12:11,686 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:12:11,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:12:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2020-02-10 20:12:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:12:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-02-10 20:12:11,689 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 16 [2020-02-10 20:12:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,689 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-02-10 20:12:11,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-02-10 20:12:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:11,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,690 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 191866437, now seen corresponding path program 37 times [2020-02-10 20:12:11,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727857438] [2020-02-10 20:12:11,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727857438] [2020-02-10 20:12:11,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:11,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904153311] [2020-02-10 20:12:11,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:11,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:11,817 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 7 states. [2020-02-10 20:12:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,857 INFO L93 Difference]: Finished difference Result 133 states and 266 transitions. [2020-02-10 20:12:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:11,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,858 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:12:11,858 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:12:11,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:12:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2020-02-10 20:12:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:12:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 215 transitions. [2020-02-10 20:12:11,863 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 215 transitions. Word has length 16 [2020-02-10 20:12:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,863 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 215 transitions. [2020-02-10 20:12:11,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 215 transitions. [2020-02-10 20:12:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:11,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:11,866 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1160628527, now seen corresponding path program 38 times [2020-02-10 20:12:11,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657085159] [2020-02-10 20:12:11,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657085159] [2020-02-10 20:12:11,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:11,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801778157] [2020-02-10 20:12:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:11,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:11,994 INFO L87 Difference]: Start difference. First operand 90 states and 215 transitions. Second operand 7 states. [2020-02-10 20:12:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,045 INFO L93 Difference]: Finished difference Result 136 states and 271 transitions. [2020-02-10 20:12:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:12,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,046 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:12:12,046 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:12:12,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:12:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2020-02-10 20:12:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:12:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 213 transitions. [2020-02-10 20:12:12,049 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 213 transitions. Word has length 16 [2020-02-10 20:12:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,050 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 213 transitions. [2020-02-10 20:12:12,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 213 transitions. [2020-02-10 20:12:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:12,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,051 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash 936568935, now seen corresponding path program 39 times [2020-02-10 20:12:12,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944196340] [2020-02-10 20:12:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944196340] [2020-02-10 20:12:12,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:12,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221503990] [2020-02-10 20:12:12,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:12,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:12,187 INFO L87 Difference]: Start difference. First operand 89 states and 213 transitions. Second operand 7 states. [2020-02-10 20:12:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,233 INFO L93 Difference]: Finished difference Result 130 states and 260 transitions. [2020-02-10 20:12:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:12,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,234 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:12:12,234 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:12:12,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:12:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2020-02-10 20:12:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-02-10 20:12:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 214 transitions. [2020-02-10 20:12:12,238 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 214 transitions. Word has length 16 [2020-02-10 20:12:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,238 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 214 transitions. [2020-02-10 20:12:12,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 214 transitions. [2020-02-10 20:12:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:12,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,239 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1783550545, now seen corresponding path program 40 times [2020-02-10 20:12:12,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029315035] [2020-02-10 20:12:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029315035] [2020-02-10 20:12:12,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:12,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830018031] [2020-02-10 20:12:12,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:12,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:12,389 INFO L87 Difference]: Start difference. First operand 90 states and 214 transitions. Second operand 7 states. [2020-02-10 20:12:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,442 INFO L93 Difference]: Finished difference Result 124 states and 255 transitions. [2020-02-10 20:12:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:12,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,443 INFO L225 Difference]: With dead ends: 124 [2020-02-10 20:12:12,443 INFO L226 Difference]: Without dead ends: 115 [2020-02-10 20:12:12,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-02-10 20:12:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2020-02-10 20:12:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-02-10 20:12:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 212 transitions. [2020-02-10 20:12:12,447 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 212 transitions. Word has length 16 [2020-02-10 20:12:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,447 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 212 transitions. [2020-02-10 20:12:12,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 212 transitions. [2020-02-10 20:12:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:12,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,448 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -674002393, now seen corresponding path program 41 times [2020-02-10 20:12:12,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158002415] [2020-02-10 20:12:12,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158002415] [2020-02-10 20:12:12,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:12,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574941498] [2020-02-10 20:12:12,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:12,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:12,618 INFO L87 Difference]: Start difference. First operand 89 states and 212 transitions. Second operand 7 states. [2020-02-10 20:12:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,789 INFO L93 Difference]: Finished difference Result 134 states and 268 transitions. [2020-02-10 20:12:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:12,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,791 INFO L225 Difference]: With dead ends: 134 [2020-02-10 20:12:12,791 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:12:12,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:12:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2020-02-10 20:12:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-02-10 20:12:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 215 transitions. [2020-02-10 20:12:12,795 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 215 transitions. Word has length 16 [2020-02-10 20:12:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,795 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 215 transitions. [2020-02-10 20:12:12,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 215 transitions. [2020-02-10 20:12:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:12,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:12,797 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash 670167527, now seen corresponding path program 42 times [2020-02-10 20:12:12,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692461777] [2020-02-10 20:12:12,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,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 20:12:12,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692461777] [2020-02-10 20:12:12,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:12,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42989579] [2020-02-10 20:12:12,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:12,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:12,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:12,973 INFO L87 Difference]: Start difference. First operand 91 states and 215 transitions. Second operand 7 states. [2020-02-10 20:12:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,028 INFO L93 Difference]: Finished difference Result 125 states and 256 transitions. [2020-02-10 20:12:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:13,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,030 INFO L225 Difference]: With dead ends: 125 [2020-02-10 20:12:13,030 INFO L226 Difference]: Without dead ends: 114 [2020-02-10 20:12:13,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-02-10 20:12:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2020-02-10 20:12:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:12:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 210 transitions. [2020-02-10 20:12:13,034 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 210 transitions. Word has length 16 [2020-02-10 20:12:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,034 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 210 transitions. [2020-02-10 20:12:13,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 210 transitions. [2020-02-10 20:12:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:13,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,035 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash 844008489, now seen corresponding path program 43 times [2020-02-10 20:12:13,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757230213] [2020-02-10 20:12:13,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757230213] [2020-02-10 20:12:13,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:13,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583720146] [2020-02-10 20:12:13,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:13,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:13,189 INFO L87 Difference]: Start difference. First operand 88 states and 210 transitions. Second operand 7 states. [2020-02-10 20:12:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,264 INFO L93 Difference]: Finished difference Result 158 states and 318 transitions. [2020-02-10 20:12:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:13,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,266 INFO L225 Difference]: With dead ends: 158 [2020-02-10 20:12:13,266 INFO L226 Difference]: Without dead ends: 146 [2020-02-10 20:12:13,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-02-10 20:12:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2020-02-10 20:12:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-02-10 20:12:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 231 transitions. [2020-02-10 20:12:13,270 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 231 transitions. Word has length 16 [2020-02-10 20:12:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,270 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 231 transitions. [2020-02-10 20:12:13,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 231 transitions. [2020-02-10 20:12:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:13,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,271 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash 846141909, now seen corresponding path program 44 times [2020-02-10 20:12:13,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024635689] [2020-02-10 20:12:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024635689] [2020-02-10 20:12:13,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:13,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961022649] [2020-02-10 20:12:13,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:13,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:13,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:13,412 INFO L87 Difference]: Start difference. First operand 98 states and 231 transitions. Second operand 7 states. [2020-02-10 20:12:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,470 INFO L93 Difference]: Finished difference Result 156 states and 310 transitions. [2020-02-10 20:12:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:13,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,476 INFO L225 Difference]: With dead ends: 156 [2020-02-10 20:12:13,476 INFO L226 Difference]: Without dead ends: 140 [2020-02-10 20:12:13,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-02-10 20:12:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2020-02-10 20:12:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:12:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 218 transitions. [2020-02-10 20:12:13,480 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 218 transitions. Word has length 16 [2020-02-10 20:12:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,480 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 218 transitions. [2020-02-10 20:12:13,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 218 transitions. [2020-02-10 20:12:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:13,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,481 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash -436396951, now seen corresponding path program 45 times [2020-02-10 20:12:13,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007924424] [2020-02-10 20:12:13,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007924424] [2020-02-10 20:12:13,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:13,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645420627] [2020-02-10 20:12:13,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:13,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:13,628 INFO L87 Difference]: Start difference. First operand 92 states and 218 transitions. Second operand 7 states. [2020-02-10 20:12:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,671 INFO L93 Difference]: Finished difference Result 147 states and 293 transitions. [2020-02-10 20:12:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:13,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,673 INFO L225 Difference]: With dead ends: 147 [2020-02-10 20:12:13,673 INFO L226 Difference]: Without dead ends: 135 [2020-02-10 20:12:13,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-02-10 20:12:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2020-02-10 20:12:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-02-10 20:12:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 222 transitions. [2020-02-10 20:12:13,677 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 222 transitions. Word has length 16 [2020-02-10 20:12:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,677 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 222 transitions. [2020-02-10 20:12:13,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 222 transitions. [2020-02-10 20:12:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:13,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,678 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1611900587, now seen corresponding path program 46 times [2020-02-10 20:12:13,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397314432] [2020-02-10 20:12:13,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397314432] [2020-02-10 20:12:13,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:13,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735901026] [2020-02-10 20:12:13,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:13,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:13,809 INFO L87 Difference]: Start difference. First operand 95 states and 222 transitions. Second operand 7 states. [2020-02-10 20:12:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,856 INFO L93 Difference]: Finished difference Result 136 states and 277 transitions. [2020-02-10 20:12:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:13,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,858 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:12:13,858 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:12:13,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:12:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2020-02-10 20:12:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-02-10 20:12:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 215 transitions. [2020-02-10 20:12:13,861 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 215 transitions. Word has length 16 [2020-02-10 20:12:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,862 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 215 transitions. [2020-02-10 20:12:13,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 215 transitions. [2020-02-10 20:12:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:13,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:13,863 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1245457199, now seen corresponding path program 47 times [2020-02-10 20:12:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014484456] [2020-02-10 20:12:13,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014484456] [2020-02-10 20:12:13,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:13,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405476291] [2020-02-10 20:12:13,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:13,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:13,992 INFO L87 Difference]: Start difference. First operand 92 states and 215 transitions. Second operand 7 states. [2020-02-10 20:12:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,049 INFO L93 Difference]: Finished difference Result 144 states and 285 transitions. [2020-02-10 20:12:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:14,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,051 INFO L225 Difference]: With dead ends: 144 [2020-02-10 20:12:14,051 INFO L226 Difference]: Without dead ends: 134 [2020-02-10 20:12:14,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-02-10 20:12:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2020-02-10 20:12:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-02-10 20:12:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 218 transitions. [2020-02-10 20:12:14,055 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 218 transitions. Word has length 16 [2020-02-10 20:12:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,056 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 218 transitions. [2020-02-10 20:12:14,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 218 transitions. [2020-02-10 20:12:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:14,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,057 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 98712721, now seen corresponding path program 48 times [2020-02-10 20:12:14,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984258982] [2020-02-10 20:12:14,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984258982] [2020-02-10 20:12:14,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:14,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962655879] [2020-02-10 20:12:14,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:14,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:14,182 INFO L87 Difference]: Start difference. First operand 94 states and 218 transitions. Second operand 7 states. [2020-02-10 20:12:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,239 INFO L93 Difference]: Finished difference Result 135 states and 273 transitions. [2020-02-10 20:12:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:14,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,241 INFO L225 Difference]: With dead ends: 135 [2020-02-10 20:12:14,242 INFO L226 Difference]: Without dead ends: 118 [2020-02-10 20:12:14,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-02-10 20:12:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2020-02-10 20:12:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:12:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 202 transitions. [2020-02-10 20:12:14,246 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 202 transitions. Word has length 16 [2020-02-10 20:12:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,247 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 202 transitions. [2020-02-10 20:12:14,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 202 transitions. [2020-02-10 20:12:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:14,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,248 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash -933023559, now seen corresponding path program 49 times [2020-02-10 20:12:14,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122242136] [2020-02-10 20:12:14,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122242136] [2020-02-10 20:12:14,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:14,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880275926] [2020-02-10 20:12:14,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:14,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:14,426 INFO L87 Difference]: Start difference. First operand 85 states and 202 transitions. Second operand 7 states. [2020-02-10 20:12:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,491 INFO L93 Difference]: Finished difference Result 135 states and 264 transitions. [2020-02-10 20:12:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:14,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,492 INFO L225 Difference]: With dead ends: 135 [2020-02-10 20:12:14,492 INFO L226 Difference]: Without dead ends: 128 [2020-02-10 20:12:14,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-02-10 20:12:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2020-02-10 20:12:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-02-10 20:12:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-02-10 20:12:14,496 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 16 [2020-02-10 20:12:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,497 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-02-10 20:12:14,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-02-10 20:12:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:14,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,498 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1476458275, now seen corresponding path program 50 times [2020-02-10 20:12:14,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611154608] [2020-02-10 20:12:14,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611154608] [2020-02-10 20:12:14,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:14,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29513230] [2020-02-10 20:12:14,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:14,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:14,663 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 7 states. [2020-02-10 20:12:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,731 INFO L93 Difference]: Finished difference Result 140 states and 272 transitions. [2020-02-10 20:12:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:14,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,732 INFO L225 Difference]: With dead ends: 140 [2020-02-10 20:12:14,732 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:12:14,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:12:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2020-02-10 20:12:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:12:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 200 transitions. [2020-02-10 20:12:14,736 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 200 transitions. Word has length 16 [2020-02-10 20:12:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,737 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 200 transitions. [2020-02-10 20:12:14,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 200 transitions. [2020-02-10 20:12:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:14,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,738 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1301083935, now seen corresponding path program 51 times [2020-02-10 20:12:14,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166403055] [2020-02-10 20:12:14,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166403055] [2020-02-10 20:12:14,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:14,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82702708] [2020-02-10 20:12:14,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:14,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:14,894 INFO L87 Difference]: Start difference. First operand 85 states and 200 transitions. Second operand 7 states. [2020-02-10 20:12:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,949 INFO L93 Difference]: Finished difference Result 130 states and 253 transitions. [2020-02-10 20:12:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:14,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,950 INFO L225 Difference]: With dead ends: 130 [2020-02-10 20:12:14,950 INFO L226 Difference]: Without dead ends: 123 [2020-02-10 20:12:14,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-02-10 20:12:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2020-02-10 20:12:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:12:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 201 transitions. [2020-02-10 20:12:14,953 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 201 transitions. Word has length 16 [2020-02-10 20:12:14,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,953 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 201 transitions. [2020-02-10 20:12:14,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 201 transitions. [2020-02-10 20:12:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:14,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,954 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:14,954 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2146901751, now seen corresponding path program 52 times [2020-02-10 20:12:14,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287100962] [2020-02-10 20:12:14,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287100962] [2020-02-10 20:12:15,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:15,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126269276] [2020-02-10 20:12:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:15,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:15,107 INFO L87 Difference]: Start difference. First operand 86 states and 201 transitions. Second operand 7 states. [2020-02-10 20:12:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,172 INFO L93 Difference]: Finished difference Result 131 states and 254 transitions. [2020-02-10 20:12:15,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:15,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,174 INFO L225 Difference]: With dead ends: 131 [2020-02-10 20:12:15,174 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:12:15,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:12:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 85. [2020-02-10 20:12:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:12:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 199 transitions. [2020-02-10 20:12:15,178 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 199 transitions. Word has length 16 [2020-02-10 20:12:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,179 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 199 transitions. [2020-02-10 20:12:15,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 199 transitions. [2020-02-10 20:12:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:15,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,180 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash -989832141, now seen corresponding path program 53 times [2020-02-10 20:12:15,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248594884] [2020-02-10 20:12:15,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:15,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248594884] [2020-02-10 20:12:15,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:15,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444704616] [2020-02-10 20:12:15,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:15,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:15,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:15,340 INFO L87 Difference]: Start difference. First operand 85 states and 199 transitions. Second operand 7 states. [2020-02-10 20:12:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,397 INFO L93 Difference]: Finished difference Result 142 states and 275 transitions. [2020-02-10 20:12:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:15,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,399 INFO L225 Difference]: With dead ends: 142 [2020-02-10 20:12:15,399 INFO L226 Difference]: Without dead ends: 130 [2020-02-10 20:12:15,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-02-10 20:12:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2020-02-10 20:12:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-02-10 20:12:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 203 transitions. [2020-02-10 20:12:15,402 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 203 transitions. Word has length 16 [2020-02-10 20:12:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,403 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 203 transitions. [2020-02-10 20:12:15,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 203 transitions. [2020-02-10 20:12:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:15,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,404 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2129631519, now seen corresponding path program 54 times [2020-02-10 20:12:15,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492933920] [2020-02-10 20:12:15,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,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 20:12:15,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492933920] [2020-02-10 20:12:15,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:15,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696110444] [2020-02-10 20:12:15,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:15,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:15,553 INFO L87 Difference]: Start difference. First operand 88 states and 203 transitions. Second operand 7 states. [2020-02-10 20:12:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,614 INFO L93 Difference]: Finished difference Result 138 states and 265 transitions. [2020-02-10 20:12:15,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:15,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,616 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:12:15,616 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:12:15,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:12:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 83. [2020-02-10 20:12:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:12:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 194 transitions. [2020-02-10 20:12:15,619 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 194 transitions. Word has length 16 [2020-02-10 20:12:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,619 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 194 transitions. [2020-02-10 20:12:15,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 194 transitions. [2020-02-10 20:12:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:15,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,620 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -397793757, now seen corresponding path program 55 times [2020-02-10 20:12:15,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649742715] [2020-02-10 20:12:15,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,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 20:12:15,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649742715] [2020-02-10 20:12:15,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:15,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728094159] [2020-02-10 20:12:15,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:15,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:15,797 INFO L87 Difference]: Start difference. First operand 83 states and 194 transitions. Second operand 7 states. [2020-02-10 20:12:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,840 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 20:12:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:15,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,841 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:12:15,841 INFO L226 Difference]: Without dead ends: 126 [2020-02-10 20:12:15,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-02-10 20:12:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 83. [2020-02-10 20:12:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-02-10 20:12:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 193 transitions. [2020-02-10 20:12:15,845 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 193 transitions. Word has length 16 [2020-02-10 20:12:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,845 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 193 transitions. [2020-02-10 20:12:15,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 193 transitions. [2020-02-10 20:12:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:15,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:15,846 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,846 INFO L82 PathProgramCache]: Analyzing trace with hash -941228473, now seen corresponding path program 56 times [2020-02-10 20:12:15,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694628881] [2020-02-10 20:12:15,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,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 20:12:15,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694628881] [2020-02-10 20:12:15,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:15,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127322701] [2020-02-10 20:12:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:15,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:15,987 INFO L87 Difference]: Start difference. First operand 83 states and 193 transitions. Second operand 7 states. [2020-02-10 20:12:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,040 INFO L93 Difference]: Finished difference Result 138 states and 265 transitions. [2020-02-10 20:12:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:16,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,042 INFO L225 Difference]: With dead ends: 138 [2020-02-10 20:12:16,042 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:12:16,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:12:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-02-10 20:12:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:12:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 188 transitions. [2020-02-10 20:12:16,045 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 188 transitions. Word has length 16 [2020-02-10 20:12:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,045 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 188 transitions. [2020-02-10 20:12:16,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 188 transitions. [2020-02-10 20:12:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:16,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,046 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1887198753, now seen corresponding path program 57 times [2020-02-10 20:12:16,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163764619] [2020-02-10 20:12:16,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163764619] [2020-02-10 20:12:16,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:16,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666681200] [2020-02-10 20:12:16,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:16,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:16,182 INFO L87 Difference]: Start difference. First operand 81 states and 188 transitions. Second operand 7 states. [2020-02-10 20:12:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,226 INFO L93 Difference]: Finished difference Result 128 states and 247 transitions. [2020-02-10 20:12:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:16,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,228 INFO L225 Difference]: With dead ends: 128 [2020-02-10 20:12:16,228 INFO L226 Difference]: Without dead ends: 121 [2020-02-10 20:12:16,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-02-10 20:12:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2020-02-10 20:12:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:12:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2020-02-10 20:12:16,231 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 189 transitions. Word has length 16 [2020-02-10 20:12:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,232 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 189 transitions. [2020-02-10 20:12:16,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 189 transitions. [2020-02-10 20:12:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:16,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,232 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1552461889, now seen corresponding path program 58 times [2020-02-10 20:12:16,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78228461] [2020-02-10 20:12:16,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78228461] [2020-02-10 20:12:16,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:16,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218254359] [2020-02-10 20:12:16,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:16,384 INFO L87 Difference]: Start difference. First operand 82 states and 189 transitions. Second operand 7 states. [2020-02-10 20:12:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,444 INFO L93 Difference]: Finished difference Result 123 states and 244 transitions. [2020-02-10 20:12:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:16,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,446 INFO L225 Difference]: With dead ends: 123 [2020-02-10 20:12:16,446 INFO L226 Difference]: Without dead ends: 113 [2020-02-10 20:12:16,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-02-10 20:12:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2020-02-10 20:12:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:12:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 187 transitions. [2020-02-10 20:12:16,449 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 187 transitions. Word has length 16 [2020-02-10 20:12:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,450 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 187 transitions. [2020-02-10 20:12:16,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 187 transitions. [2020-02-10 20:12:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:16,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,451 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1685930971, now seen corresponding path program 59 times [2020-02-10 20:12:16,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108154319] [2020-02-10 20:12:16,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108154319] [2020-02-10 20:12:16,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:16,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650228271] [2020-02-10 20:12:16,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:16,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:16,611 INFO L87 Difference]: Start difference. First operand 81 states and 187 transitions. Second operand 7 states. [2020-02-10 20:12:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,656 INFO L93 Difference]: Finished difference Result 136 states and 263 transitions. [2020-02-10 20:12:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:16,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,658 INFO L225 Difference]: With dead ends: 136 [2020-02-10 20:12:16,658 INFO L226 Difference]: Without dead ends: 124 [2020-02-10 20:12:16,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-02-10 20:12:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 85. [2020-02-10 20:12:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:12:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 193 transitions. [2020-02-10 20:12:16,662 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 193 transitions. Word has length 16 [2020-02-10 20:12:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,662 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 193 transitions. [2020-02-10 20:12:16,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 193 transitions. [2020-02-10 20:12:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:16,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,663 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash -760187613, now seen corresponding path program 60 times [2020-02-10 20:12:16,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27164630] [2020-02-10 20:12:16,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27164630] [2020-02-10 20:12:16,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:16,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987831585] [2020-02-10 20:12:16,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:16,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:16,812 INFO L87 Difference]: Start difference. First operand 85 states and 193 transitions. Second operand 7 states. [2020-02-10 20:12:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,873 INFO L93 Difference]: Finished difference Result 126 states and 248 transitions. [2020-02-10 20:12:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:16,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,874 INFO L225 Difference]: With dead ends: 126 [2020-02-10 20:12:16,874 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:12:16,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:12:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2020-02-10 20:12:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:12:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-02-10 20:12:16,879 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 16 [2020-02-10 20:12:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,879 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-02-10 20:12:16,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-02-10 20:12:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:16,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:16,880 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1920797981, now seen corresponding path program 61 times [2020-02-10 20:12:16,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318045462] [2020-02-10 20:12:16,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318045462] [2020-02-10 20:12:17,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:17,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508643120] [2020-02-10 20:12:17,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:17,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:17,035 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 7 states. [2020-02-10 20:12:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,095 INFO L93 Difference]: Finished difference Result 120 states and 230 transitions. [2020-02-10 20:12:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:17,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,097 INFO L225 Difference]: With dead ends: 120 [2020-02-10 20:12:17,097 INFO L226 Difference]: Without dead ends: 113 [2020-02-10 20:12:17,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-02-10 20:12:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2020-02-10 20:12:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:12:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 186 transitions. [2020-02-10 20:12:17,100 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 186 transitions. Word has length 16 [2020-02-10 20:12:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,101 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 186 transitions. [2020-02-10 20:12:17,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 186 transitions. [2020-02-10 20:12:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:17,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,101 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1073816371, now seen corresponding path program 62 times [2020-02-10 20:12:17,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508680772] [2020-02-10 20:12:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,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 20:12:17,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508680772] [2020-02-10 20:12:17,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:17,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443004243] [2020-02-10 20:12:17,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:17,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:17,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:17,265 INFO L87 Difference]: Start difference. First operand 81 states and 186 transitions. Second operand 7 states. [2020-02-10 20:12:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,326 INFO L93 Difference]: Finished difference Result 121 states and 231 transitions. [2020-02-10 20:12:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:17,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,328 INFO L225 Difference]: With dead ends: 121 [2020-02-10 20:12:17,328 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:12:17,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:12:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2020-02-10 20:12:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-02-10 20:12:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 184 transitions. [2020-02-10 20:12:17,331 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 184 transitions. Word has length 16 [2020-02-10 20:12:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,331 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 184 transitions. [2020-02-10 20:12:17,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 184 transitions. [2020-02-10 20:12:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:17,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,332 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1349343175, now seen corresponding path program 63 times [2020-02-10 20:12:17,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989926667] [2020-02-10 20:12:17,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989926667] [2020-02-10 20:12:17,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436504406] [2020-02-10 20:12:17,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:17,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:17,522 INFO L87 Difference]: Start difference. First operand 80 states and 184 transitions. Second operand 7 states. [2020-02-10 20:12:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,566 INFO L93 Difference]: Finished difference Result 119 states and 228 transitions. [2020-02-10 20:12:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:17,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,567 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:12:17,567 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:12:17,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:12:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2020-02-10 20:12:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-02-10 20:12:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 185 transitions. [2020-02-10 20:12:17,570 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 185 transitions. Word has length 16 [2020-02-10 20:12:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,570 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 185 transitions. [2020-02-10 20:12:17,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 185 transitions. [2020-02-10 20:12:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:17,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,571 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2090317467, now seen corresponding path program 64 times [2020-02-10 20:12:17,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479259596] [2020-02-10 20:12:17,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479259596] [2020-02-10 20:12:17,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:17,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508377902] [2020-02-10 20:12:17,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:17,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:17,791 INFO L87 Difference]: Start difference. First operand 81 states and 185 transitions. Second operand 7 states. [2020-02-10 20:12:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,850 INFO L93 Difference]: Finished difference Result 114 states and 225 transitions. [2020-02-10 20:12:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:17,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,852 INFO L225 Difference]: With dead ends: 114 [2020-02-10 20:12:17,852 INFO L226 Difference]: Without dead ends: 104 [2020-02-10 20:12:17,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-02-10 20:12:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2020-02-10 20:12:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-02-10 20:12:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2020-02-10 20:12:17,855 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 16 [2020-02-10 20:12:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,855 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2020-02-10 20:12:17,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2020-02-10 20:12:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:17,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:17,856 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1818518869, now seen corresponding path program 65 times [2020-02-10 20:12:17,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072991100] [2020-02-10 20:12:17,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072991100] [2020-02-10 20:12:18,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:18,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606288136] [2020-02-10 20:12:18,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:18,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:18,015 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand 7 states. [2020-02-10 20:12:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,084 INFO L93 Difference]: Finished difference Result 114 states and 226 transitions. [2020-02-10 20:12:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:18,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,086 INFO L225 Difference]: With dead ends: 114 [2020-02-10 20:12:18,087 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 20:12:18,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 20:12:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-02-10 20:12:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:12:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 186 transitions. [2020-02-10 20:12:18,091 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 186 transitions. Word has length 16 [2020-02-10 20:12:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,091 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 186 transitions. [2020-02-10 20:12:18,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 186 transitions. [2020-02-10 20:12:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:18,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,093 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 3293241, now seen corresponding path program 66 times [2020-02-10 20:12:18,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263047960] [2020-02-10 20:12:18,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263047960] [2020-02-10 20:12:18,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:18,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007692521] [2020-02-10 20:12:18,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:18,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:18,281 INFO L87 Difference]: Start difference. First operand 82 states and 186 transitions. Second operand 7 states. [2020-02-10 20:12:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,334 INFO L93 Difference]: Finished difference Result 105 states and 215 transitions. [2020-02-10 20:12:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:18,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,335 INFO L225 Difference]: With dead ends: 105 [2020-02-10 20:12:18,335 INFO L226 Difference]: Without dead ends: 93 [2020-02-10 20:12:18,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-02-10 20:12:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2020-02-10 20:12:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:12:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 181 transitions. [2020-02-10 20:12:18,338 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 181 transitions. Word has length 16 [2020-02-10 20:12:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,338 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 181 transitions. [2020-02-10 20:12:18,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 181 transitions. [2020-02-10 20:12:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:18,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,339 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1694194197, now seen corresponding path program 67 times [2020-02-10 20:12:18,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080837640] [2020-02-10 20:12:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080837640] [2020-02-10 20:12:18,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:18,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506326082] [2020-02-10 20:12:18,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:18,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:18,476 INFO L87 Difference]: Start difference. First operand 79 states and 181 transitions. Second operand 7 states. [2020-02-10 20:12:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,519 INFO L93 Difference]: Finished difference Result 137 states and 267 transitions. [2020-02-10 20:12:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:18,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,520 INFO L225 Difference]: With dead ends: 137 [2020-02-10 20:12:18,520 INFO L226 Difference]: Without dead ends: 125 [2020-02-10 20:12:18,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-02-10 20:12:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2020-02-10 20:12:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-02-10 20:12:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 195 transitions. [2020-02-10 20:12:18,524 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 195 transitions. Word has length 16 [2020-02-10 20:12:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,524 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 195 transitions. [2020-02-10 20:12:18,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 195 transitions. [2020-02-10 20:12:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:18,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,525 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash 518690561, now seen corresponding path program 68 times [2020-02-10 20:12:18,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126187027] [2020-02-10 20:12:18,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126187027] [2020-02-10 20:12:18,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:18,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593488153] [2020-02-10 20:12:18,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:18,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:18,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:18,658 INFO L87 Difference]: Start difference. First operand 85 states and 195 transitions. Second operand 7 states. [2020-02-10 20:12:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,715 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-02-10 20:12:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:18,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,717 INFO L225 Difference]: With dead ends: 133 [2020-02-10 20:12:18,717 INFO L226 Difference]: Without dead ends: 122 [2020-02-10 20:12:18,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-02-10 20:12:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2020-02-10 20:12:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:12:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 188 transitions. [2020-02-10 20:12:18,721 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 188 transitions. Word has length 16 [2020-02-10 20:12:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,721 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 188 transitions. [2020-02-10 20:12:18,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 188 transitions. [2020-02-10 20:12:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:18,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,722 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1959172537, now seen corresponding path program 69 times [2020-02-10 20:12:18,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624947313] [2020-02-10 20:12:18,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624947313] [2020-02-10 20:12:18,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:18,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829350615] [2020-02-10 20:12:18,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:18,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:18,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:18,887 INFO L87 Difference]: Start difference. First operand 82 states and 188 transitions. Second operand 7 states. [2020-02-10 20:12:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,933 INFO L93 Difference]: Finished difference Result 129 states and 249 transitions. [2020-02-10 20:12:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:18,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,935 INFO L225 Difference]: With dead ends: 129 [2020-02-10 20:12:18,935 INFO L226 Difference]: Without dead ends: 117 [2020-02-10 20:12:18,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-02-10 20:12:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2020-02-10 20:12:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-02-10 20:12:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 194 transitions. [2020-02-10 20:12:18,938 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 194 transitions. Word has length 16 [2020-02-10 20:12:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,939 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 194 transitions. [2020-02-10 20:12:18,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 194 transitions. [2020-02-10 20:12:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:18,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:18,939 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1440320653, now seen corresponding path program 70 times [2020-02-10 20:12:18,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30721410] [2020-02-10 20:12:18,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30721410] [2020-02-10 20:12:19,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:19,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401636847] [2020-02-10 20:12:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:19,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:19,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:19,089 INFO L87 Difference]: Start difference. First operand 86 states and 194 transitions. Second operand 7 states. [2020-02-10 20:12:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,146 INFO L93 Difference]: Finished difference Result 119 states and 234 transitions. [2020-02-10 20:12:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:19,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,148 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:12:19,148 INFO L226 Difference]: Without dead ends: 106 [2020-02-10 20:12:19,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-02-10 20:12:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-02-10 20:12:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-02-10 20:12:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 185 transitions. [2020-02-10 20:12:19,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 185 transitions. Word has length 16 [2020-02-10 20:12:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,152 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 185 transitions. [2020-02-10 20:12:19,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 185 transitions. [2020-02-10 20:12:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:19,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,153 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash -568756211, now seen corresponding path program 71 times [2020-02-10 20:12:19,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091207563] [2020-02-10 20:12:19,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091207563] [2020-02-10 20:12:19,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:19,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607710532] [2020-02-10 20:12:19,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:19,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:19,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:19,291 INFO L87 Difference]: Start difference. First operand 82 states and 185 transitions. Second operand 7 states. [2020-02-10 20:12:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,341 INFO L93 Difference]: Finished difference Result 116 states and 228 transitions. [2020-02-10 20:12:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:19,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,342 INFO L225 Difference]: With dead ends: 116 [2020-02-10 20:12:19,343 INFO L226 Difference]: Without dead ends: 108 [2020-02-10 20:12:19,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-02-10 20:12:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2020-02-10 20:12:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-02-10 20:12:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 188 transitions. [2020-02-10 20:12:19,345 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 188 transitions. Word has length 16 [2020-02-10 20:12:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,346 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 188 transitions. [2020-02-10 20:12:19,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 188 transitions. [2020-02-10 20:12:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:19,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,347 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash -568161565, now seen corresponding path program 72 times [2020-02-10 20:12:19,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289140624] [2020-02-10 20:12:19,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289140624] [2020-02-10 20:12:19,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:19,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394531240] [2020-02-10 20:12:19,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:19,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:19,505 INFO L87 Difference]: Start difference. First operand 84 states and 188 transitions. Second operand 7 states. [2020-02-10 20:12:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,560 INFO L93 Difference]: Finished difference Result 107 states and 217 transitions. [2020-02-10 20:12:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:19,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,562 INFO L225 Difference]: With dead ends: 107 [2020-02-10 20:12:19,562 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:12:19,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:12:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2020-02-10 20:12:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:12:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 176 transitions. [2020-02-10 20:12:19,568 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 176 transitions. Word has length 16 [2020-02-10 20:12:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,568 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 176 transitions. [2020-02-10 20:12:19,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 176 transitions. [2020-02-10 20:12:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:19,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,569 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash 577387645, now seen corresponding path program 73 times [2020-02-10 20:12:19,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226466294] [2020-02-10 20:12:19,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226466294] [2020-02-10 20:12:19,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:19,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263494553] [2020-02-10 20:12:19,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:19,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:19,721 INFO L87 Difference]: Start difference. First operand 77 states and 176 transitions. Second operand 7 states. [2020-02-10 20:12:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,761 INFO L93 Difference]: Finished difference Result 119 states and 225 transitions. [2020-02-10 20:12:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:19,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,763 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:12:19,763 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:12:19,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:12:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-02-10 20:12:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:12:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-02-10 20:12:19,765 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 16 [2020-02-10 20:12:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,766 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-02-10 20:12:19,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-02-10 20:12:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:19,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,767 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash -775107319, now seen corresponding path program 74 times [2020-02-10 20:12:19,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305456586] [2020-02-10 20:12:19,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305456586] [2020-02-10 20:12:19,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:19,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869194588] [2020-02-10 20:12:19,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:19,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:19,900 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 7 states. [2020-02-10 20:12:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,961 INFO L93 Difference]: Finished difference Result 122 states and 230 transitions. [2020-02-10 20:12:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:19,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,962 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:12:19,963 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:12:19,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:12:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2020-02-10 20:12:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:12:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 175 transitions. [2020-02-10 20:12:19,966 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 175 transitions. Word has length 16 [2020-02-10 20:12:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,966 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 175 transitions. [2020-02-10 20:12:19,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 175 transitions. [2020-02-10 20:12:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:19,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,967 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1322090143, now seen corresponding path program 75 times [2020-02-10 20:12:19,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994182927] [2020-02-10 20:12:19,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994182927] [2020-02-10 20:12:20,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:20,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486368295] [2020-02-10 20:12:20,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:20,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:20,142 INFO L87 Difference]: Start difference. First operand 77 states and 175 transitions. Second operand 7 states. [2020-02-10 20:12:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,207 INFO L93 Difference]: Finished difference Result 117 states and 220 transitions. [2020-02-10 20:12:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:20,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,209 INFO L225 Difference]: With dead ends: 117 [2020-02-10 20:12:20,209 INFO L226 Difference]: Without dead ends: 110 [2020-02-10 20:12:20,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-02-10 20:12:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2020-02-10 20:12:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:12:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 176 transitions. [2020-02-10 20:12:20,212 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 176 transitions. Word has length 16 [2020-02-10 20:12:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,212 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 176 transitions. [2020-02-10 20:12:20,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 176 transitions. [2020-02-10 20:12:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:20,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,213 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2125895543, now seen corresponding path program 76 times [2020-02-10 20:12:20,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218926748] [2020-02-10 20:12:20,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218926748] [2020-02-10 20:12:20,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:20,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764875362] [2020-02-10 20:12:20,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:20,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:20,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:20,367 INFO L87 Difference]: Start difference. First operand 78 states and 176 transitions. Second operand 7 states. [2020-02-10 20:12:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,437 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2020-02-10 20:12:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:20,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,438 INFO L225 Difference]: With dead ends: 118 [2020-02-10 20:12:20,438 INFO L226 Difference]: Without dead ends: 109 [2020-02-10 20:12:20,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-02-10 20:12:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 77. [2020-02-10 20:12:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-02-10 20:12:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 174 transitions. [2020-02-10 20:12:20,441 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 174 transitions. Word has length 16 [2020-02-10 20:12:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,442 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 174 transitions. [2020-02-10 20:12:20,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 174 transitions. [2020-02-10 20:12:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:20,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,442 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -288481185, now seen corresponding path program 77 times [2020-02-10 20:12:20,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860029955] [2020-02-10 20:12:20,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,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 20:12:20,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860029955] [2020-02-10 20:12:20,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:20,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458957847] [2020-02-10 20:12:20,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:20,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:20,577 INFO L87 Difference]: Start difference. First operand 77 states and 174 transitions. Second operand 7 states. [2020-02-10 20:12:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,639 INFO L93 Difference]: Finished difference Result 124 states and 234 transitions. [2020-02-10 20:12:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:20,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,641 INFO L225 Difference]: With dead ends: 124 [2020-02-10 20:12:20,641 INFO L226 Difference]: Without dead ends: 114 [2020-02-10 20:12:20,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-02-10 20:12:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 79. [2020-02-10 20:12:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-02-10 20:12:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 177 transitions. [2020-02-10 20:12:20,644 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 177 transitions. Word has length 16 [2020-02-10 20:12:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,645 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 177 transitions. [2020-02-10 20:12:20,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 177 transitions. [2020-02-10 20:12:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:20,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,646 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1055688735, now seen corresponding path program 78 times [2020-02-10 20:12:20,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653129677] [2020-02-10 20:12:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653129677] [2020-02-10 20:12:20,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:20,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88923786] [2020-02-10 20:12:20,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:20,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:20,785 INFO L87 Difference]: Start difference. First operand 79 states and 177 transitions. Second operand 7 states. [2020-02-10 20:12:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,869 INFO L93 Difference]: Finished difference Result 122 states and 228 transitions. [2020-02-10 20:12:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:20,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,870 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:12:20,870 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:12:20,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:12:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 76. [2020-02-10 20:12:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 20:12:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 172 transitions. [2020-02-10 20:12:20,875 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 172 transitions. Word has length 16 [2020-02-10 20:12:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,876 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 172 transitions. [2020-02-10 20:12:20,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 172 transitions. [2020-02-10 20:12:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:20,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:20,878 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1112617447, now seen corresponding path program 79 times [2020-02-10 20:12:20,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981140084] [2020-02-10 20:12:20,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981140084] [2020-02-10 20:12:21,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:21,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746482977] [2020-02-10 20:12:21,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:21,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:21,081 INFO L87 Difference]: Start difference. First operand 76 states and 172 transitions. Second operand 7 states. [2020-02-10 20:12:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,132 INFO L93 Difference]: Finished difference Result 119 states and 224 transitions. [2020-02-10 20:12:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:21,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,134 INFO L225 Difference]: With dead ends: 119 [2020-02-10 20:12:21,134 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:12:21,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:12:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2020-02-10 20:12:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 20:12:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 171 transitions. [2020-02-10 20:12:21,139 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 171 transitions. Word has length 16 [2020-02-10 20:12:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,140 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 171 transitions. [2020-02-10 20:12:21,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 171 transitions. [2020-02-10 20:12:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:21,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,141 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash -239877517, now seen corresponding path program 80 times [2020-02-10 20:12:21,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475503820] [2020-02-10 20:12:21,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475503820] [2020-02-10 20:12:21,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:21,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234427935] [2020-02-10 20:12:21,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:21,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:21,301 INFO L87 Difference]: Start difference. First operand 76 states and 171 transitions. Second operand 7 states. [2020-02-10 20:12:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,385 INFO L93 Difference]: Finished difference Result 122 states and 229 transitions. [2020-02-10 20:12:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:21,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,387 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:12:21,388 INFO L226 Difference]: Without dead ends: 111 [2020-02-10 20:12:21,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-02-10 20:12:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2020-02-10 20:12:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:12:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 169 transitions. [2020-02-10 20:12:21,392 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 169 transitions. Word has length 16 [2020-02-10 20:12:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,392 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 169 transitions. [2020-02-10 20:12:21,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 169 transitions. [2020-02-10 20:12:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:21,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,394 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1866192545, now seen corresponding path program 81 times [2020-02-10 20:12:21,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857593793] [2020-02-10 20:12:21,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857593793] [2020-02-10 20:12:21,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:21,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97755272] [2020-02-10 20:12:21,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:21,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:21,596 INFO L87 Difference]: Start difference. First operand 75 states and 169 transitions. Second operand 7 states. [2020-02-10 20:12:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,654 INFO L93 Difference]: Finished difference Result 117 states and 220 transitions. [2020-02-10 20:12:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:21,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,656 INFO L225 Difference]: With dead ends: 117 [2020-02-10 20:12:21,657 INFO L226 Difference]: Without dead ends: 110 [2020-02-10 20:12:21,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-02-10 20:12:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2020-02-10 20:12:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-02-10 20:12:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 170 transitions. [2020-02-10 20:12:21,663 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 170 transitions. Word has length 16 [2020-02-10 20:12:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,664 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 170 transitions. [2020-02-10 20:12:21,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 170 transitions. [2020-02-10 20:12:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:21,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,667 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,667 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1573468097, now seen corresponding path program 82 times [2020-02-10 20:12:21,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060759354] [2020-02-10 20:12:21,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060759354] [2020-02-10 20:12:21,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:21,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143937060] [2020-02-10 20:12:21,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:21,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:21,810 INFO L87 Difference]: Start difference. First operand 76 states and 170 transitions. Second operand 7 states. [2020-02-10 20:12:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,864 INFO L93 Difference]: Finished difference Result 112 states and 217 transitions. [2020-02-10 20:12:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:21,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,866 INFO L225 Difference]: With dead ends: 112 [2020-02-10 20:12:21,866 INFO L226 Difference]: Without dead ends: 102 [2020-02-10 20:12:21,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-02-10 20:12:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-02-10 20:12:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:12:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-02-10 20:12:21,870 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 16 [2020-02-10 20:12:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,871 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-02-10 20:12:21,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-02-10 20:12:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:21,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:21,872 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -984580015, now seen corresponding path program 83 times [2020-02-10 20:12:21,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033278679] [2020-02-10 20:12:21,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:21,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033278679] [2020-02-10 20:12:21,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:22,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209282301] [2020-02-10 20:12:22,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:22,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:22,001 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 7 states. [2020-02-10 20:12:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,061 INFO L93 Difference]: Finished difference Result 122 states and 231 transitions. [2020-02-10 20:12:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:22,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,063 INFO L225 Difference]: With dead ends: 122 [2020-02-10 20:12:22,063 INFO L226 Difference]: Without dead ends: 112 [2020-02-10 20:12:22,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-02-10 20:12:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2020-02-10 20:12:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-02-10 20:12:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 173 transitions. [2020-02-10 20:12:22,065 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 173 transitions. Word has length 16 [2020-02-10 20:12:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,065 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 173 transitions. [2020-02-10 20:12:22,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 173 transitions. [2020-02-10 20:12:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:22,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,066 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash -116381337, now seen corresponding path program 84 times [2020-02-10 20:12:22,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705676463] [2020-02-10 20:12:22,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705676463] [2020-02-10 20:12:22,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:22,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894735852] [2020-02-10 20:12:22,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:22,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:22,228 INFO L87 Difference]: Start difference. First operand 78 states and 173 transitions. Second operand 7 states. [2020-02-10 20:12:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,279 INFO L93 Difference]: Finished difference Result 114 states and 220 transitions. [2020-02-10 20:12:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:22,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,280 INFO L225 Difference]: With dead ends: 114 [2020-02-10 20:12:22,281 INFO L226 Difference]: Without dead ends: 101 [2020-02-10 20:12:22,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-02-10 20:12:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2020-02-10 20:12:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:12:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 166 transitions. [2020-02-10 20:12:22,283 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 166 transitions. Word has length 16 [2020-02-10 20:12:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,283 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 166 transitions. [2020-02-10 20:12:22,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 166 transitions. [2020-02-10 20:12:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:22,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,284 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash -826706393, now seen corresponding path program 85 times [2020-02-10 20:12:22,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077456574] [2020-02-10 20:12:22,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077456574] [2020-02-10 20:12:22,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:22,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306049778] [2020-02-10 20:12:22,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:22,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:22,438 INFO L87 Difference]: Start difference. First operand 74 states and 166 transitions. Second operand 7 states. [2020-02-10 20:12:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,479 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-02-10 20:12:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:22,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,480 INFO L225 Difference]: With dead ends: 111 [2020-02-10 20:12:22,480 INFO L226 Difference]: Without dead ends: 104 [2020-02-10 20:12:22,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-02-10 20:12:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2020-02-10 20:12:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:12:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 165 transitions. [2020-02-10 20:12:22,483 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 165 transitions. Word has length 16 [2020-02-10 20:12:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,483 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 165 transitions. [2020-02-10 20:12:22,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 165 transitions. [2020-02-10 20:12:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:22,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,484 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash 20275217, now seen corresponding path program 86 times [2020-02-10 20:12:22,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619742144] [2020-02-10 20:12:22,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619742144] [2020-02-10 20:12:22,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:22,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580766885] [2020-02-10 20:12:22,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:22,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:22,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:22,643 INFO L87 Difference]: Start difference. First operand 74 states and 165 transitions. Second operand 7 states. [2020-02-10 20:12:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,708 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2020-02-10 20:12:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:22,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,710 INFO L225 Difference]: With dead ends: 112 [2020-02-10 20:12:22,710 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 20:12:22,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 20:12:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2020-02-10 20:12:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:12:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 163 transitions. [2020-02-10 20:12:22,714 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 163 transitions. Word has length 16 [2020-02-10 20:12:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,714 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 163 transitions. [2020-02-10 20:12:22,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 163 transitions. [2020-02-10 20:12:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:22,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,715 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash -255251587, now seen corresponding path program 87 times [2020-02-10 20:12:22,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866670580] [2020-02-10 20:12:22,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866670580] [2020-02-10 20:12:22,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:22,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579968138] [2020-02-10 20:12:22,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:22,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:22,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:22,878 INFO L87 Difference]: Start difference. First operand 73 states and 163 transitions. Second operand 7 states. [2020-02-10 20:12:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,928 INFO L93 Difference]: Finished difference Result 110 states and 204 transitions. [2020-02-10 20:12:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:22,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,929 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:12:22,929 INFO L226 Difference]: Without dead ends: 103 [2020-02-10 20:12:22,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-02-10 20:12:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2020-02-10 20:12:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:12:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 161 transitions. [2020-02-10 20:12:22,931 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 161 transitions. Word has length 16 [2020-02-10 20:12:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,932 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 161 transitions. [2020-02-10 20:12:22,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 161 transitions. [2020-02-10 20:12:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:22,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:22,932 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1110558241, now seen corresponding path program 88 times [2020-02-10 20:12:22,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091804158] [2020-02-10 20:12:22,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091804158] [2020-02-10 20:12:23,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:23,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226023210] [2020-02-10 20:12:23,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:23,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:23,077 INFO L87 Difference]: Start difference. First operand 72 states and 161 transitions. Second operand 7 states. [2020-02-10 20:12:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,138 INFO L93 Difference]: Finished difference Result 105 states and 201 transitions. [2020-02-10 20:12:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:23,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,140 INFO L225 Difference]: With dead ends: 105 [2020-02-10 20:12:23,140 INFO L226 Difference]: Without dead ends: 95 [2020-02-10 20:12:23,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-02-10 20:12:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2020-02-10 20:12:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:12:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 159 transitions. [2020-02-10 20:12:23,143 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 159 transitions. Word has length 16 [2020-02-10 20:12:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,143 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 159 transitions. [2020-02-10 20:12:23,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 159 transitions. [2020-02-10 20:12:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:23,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,144 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash -724427281, now seen corresponding path program 89 times [2020-02-10 20:12:23,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022537781] [2020-02-10 20:12:23,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022537781] [2020-02-10 20:12:23,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:23,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775698262] [2020-02-10 20:12:23,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:23,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:23,297 INFO L87 Difference]: Start difference. First operand 71 states and 159 transitions. Second operand 7 states. [2020-02-10 20:12:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,361 INFO L93 Difference]: Finished difference Result 105 states and 202 transitions. [2020-02-10 20:12:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:23,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,363 INFO L225 Difference]: With dead ends: 105 [2020-02-10 20:12:23,363 INFO L226 Difference]: Without dead ends: 97 [2020-02-10 20:12:23,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-02-10 20:12:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 73. [2020-02-10 20:12:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-02-10 20:12:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 162 transitions. [2020-02-10 20:12:23,366 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 162 transitions. Word has length 16 [2020-02-10 20:12:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,366 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 162 transitions. [2020-02-10 20:12:23,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 162 transitions. [2020-02-10 20:12:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:23,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,367 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1097384829, now seen corresponding path program 90 times [2020-02-10 20:12:23,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925145261] [2020-02-10 20:12:23,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925145261] [2020-02-10 20:12:23,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:23,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983707639] [2020-02-10 20:12:23,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:23,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:23,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:23,549 INFO L87 Difference]: Start difference. First operand 73 states and 162 transitions. Second operand 7 states. [2020-02-10 20:12:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,619 INFO L93 Difference]: Finished difference Result 96 states and 191 transitions. [2020-02-10 20:12:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:23,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,620 INFO L225 Difference]: With dead ends: 96 [2020-02-10 20:12:23,620 INFO L226 Difference]: Without dead ends: 84 [2020-02-10 20:12:23,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-02-10 20:12:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-02-10 20:12:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-02-10 20:12:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 157 transitions. [2020-02-10 20:12:23,623 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 157 transitions. Word has length 16 [2020-02-10 20:12:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,623 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 157 transitions. [2020-02-10 20:12:23,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 157 transitions. [2020-02-10 20:12:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:23,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,624 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1899422143, now seen corresponding path program 91 times [2020-02-10 20:12:23,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776770636] [2020-02-10 20:12:23,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:23,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776770636] [2020-02-10 20:12:23,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:23,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529459146] [2020-02-10 20:12:23,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:23,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:23,791 INFO L87 Difference]: Start difference. First operand 70 states and 157 transitions. Second operand 7 states. [2020-02-10 20:12:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,860 INFO L93 Difference]: Finished difference Result 112 states and 221 transitions. [2020-02-10 20:12:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:23,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,861 INFO L225 Difference]: With dead ends: 112 [2020-02-10 20:12:23,861 INFO L226 Difference]: Without dead ends: 102 [2020-02-10 20:12:23,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-02-10 20:12:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2020-02-10 20:12:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:12:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 167 transitions. [2020-02-10 20:12:23,864 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 167 transitions. Word has length 16 [2020-02-10 20:12:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,864 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 167 transitions. [2020-02-10 20:12:23,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 167 transitions. [2020-02-10 20:12:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:23,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:23,865 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -555252223, now seen corresponding path program 92 times [2020-02-10 20:12:23,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331859389] [2020-02-10 20:12:23,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:23,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 20:12:23,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331859389] [2020-02-10 20:12:23,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:23,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326820588] [2020-02-10 20:12:23,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:23,989 INFO L87 Difference]: Start difference. First operand 74 states and 167 transitions. Second operand 7 states. [2020-02-10 20:12:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,040 INFO L93 Difference]: Finished difference Result 110 states and 215 transitions. [2020-02-10 20:12:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:24,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,041 INFO L225 Difference]: With dead ends: 110 [2020-02-10 20:12:24,041 INFO L226 Difference]: Without dead ends: 100 [2020-02-10 20:12:24,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-02-10 20:12:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2020-02-10 20:12:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:12:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 162 transitions. [2020-02-10 20:12:24,045 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 162 transitions. Word has length 16 [2020-02-10 20:12:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,046 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 162 transitions. [2020-02-10 20:12:24,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 162 transitions. [2020-02-10 20:12:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:24,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,046 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1257821581, now seen corresponding path program 93 times [2020-02-10 20:12:24,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183596906] [2020-02-10 20:12:24,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183596906] [2020-02-10 20:12:24,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:24,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537446131] [2020-02-10 20:12:24,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:24,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:24,175 INFO L87 Difference]: Start difference. First operand 72 states and 162 transitions. Second operand 7 states. [2020-02-10 20:12:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,228 INFO L93 Difference]: Finished difference Result 106 states and 207 transitions. [2020-02-10 20:12:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:24,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,230 INFO L225 Difference]: With dead ends: 106 [2020-02-10 20:12:24,230 INFO L226 Difference]: Without dead ends: 96 [2020-02-10 20:12:24,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-02-10 20:12:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2020-02-10 20:12:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:12:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 167 transitions. [2020-02-10 20:12:24,233 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 167 transitions. Word has length 16 [2020-02-10 20:12:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,233 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 167 transitions. [2020-02-10 20:12:24,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 167 transitions. [2020-02-10 20:12:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:24,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,234 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2084126929, now seen corresponding path program 94 times [2020-02-10 20:12:24,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894467502] [2020-02-10 20:12:24,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894467502] [2020-02-10 20:12:24,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:24,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748484251] [2020-02-10 20:12:24,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:24,374 INFO L87 Difference]: Start difference. First operand 75 states and 167 transitions. Second operand 7 states. [2020-02-10 20:12:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,438 INFO L93 Difference]: Finished difference Result 98 states and 196 transitions. [2020-02-10 20:12:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:24,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,439 INFO L225 Difference]: With dead ends: 98 [2020-02-10 20:12:24,439 INFO L226 Difference]: Without dead ends: 86 [2020-02-10 20:12:24,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-02-10 20:12:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2020-02-10 20:12:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:12:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 160 transitions. [2020-02-10 20:12:24,442 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 160 transitions. Word has length 16 [2020-02-10 20:12:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,443 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 160 transitions. [2020-02-10 20:12:24,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 160 transitions. [2020-02-10 20:12:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:24,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,443 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash 941654993, now seen corresponding path program 95 times [2020-02-10 20:12:24,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949194116] [2020-02-10 20:12:24,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949194116] [2020-02-10 20:12:24,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:24,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494670641] [2020-02-10 20:12:24,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:24,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:24,587 INFO L87 Difference]: Start difference. First operand 72 states and 160 transitions. Second operand 7 states. [2020-02-10 20:12:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,643 INFO L93 Difference]: Finished difference Result 92 states and 184 transitions. [2020-02-10 20:12:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:24,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,644 INFO L225 Difference]: With dead ends: 92 [2020-02-10 20:12:24,644 INFO L226 Difference]: Without dead ends: 84 [2020-02-10 20:12:24,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-02-10 20:12:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-02-10 20:12:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-02-10 20:12:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 163 transitions. [2020-02-10 20:12:24,647 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 163 transitions. Word has length 16 [2020-02-10 20:12:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,647 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 163 transitions. [2020-02-10 20:12:24,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 163 transitions. [2020-02-10 20:12:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:24,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,648 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash 942249639, now seen corresponding path program 96 times [2020-02-10 20:12:24,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153134953] [2020-02-10 20:12:24,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,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 20:12:24,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153134953] [2020-02-10 20:12:24,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:24,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384266359] [2020-02-10 20:12:24,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:24,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:24,805 INFO L87 Difference]: Start difference. First operand 74 states and 163 transitions. Second operand 7 states. [2020-02-10 20:12:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,857 INFO L93 Difference]: Finished difference Result 83 states and 173 transitions. [2020-02-10 20:12:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:24,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,858 INFO L225 Difference]: With dead ends: 83 [2020-02-10 20:12:24,858 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:12:24,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:12:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-02-10 20:12:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 20:12:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 155 transitions. [2020-02-10 20:12:24,862 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 155 transitions. Word has length 16 [2020-02-10 20:12:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,862 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 155 transitions. [2020-02-10 20:12:24,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 155 transitions. [2020-02-10 20:12:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:24,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:24,862 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,863 INFO L82 PathProgramCache]: Analyzing trace with hash -370908157, now seen corresponding path program 97 times [2020-02-10 20:12:24,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468097879] [2020-02-10 20:12:24,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468097879] [2020-02-10 20:12:25,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:25,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671042355] [2020-02-10 20:12:25,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:25,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:25,026 INFO L87 Difference]: Start difference. First operand 69 states and 155 transitions. Second operand 7 states. [2020-02-10 20:12:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,066 INFO L93 Difference]: Finished difference Result 111 states and 213 transitions. [2020-02-10 20:12:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:25,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,068 INFO L225 Difference]: With dead ends: 111 [2020-02-10 20:12:25,068 INFO L226 Difference]: Without dead ends: 99 [2020-02-10 20:12:25,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-02-10 20:12:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2020-02-10 20:12:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-02-10 20:12:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 164 transitions. [2020-02-10 20:12:25,071 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 164 transitions. Word has length 16 [2020-02-10 20:12:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,071 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 164 transitions. [2020-02-10 20:12:25,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 164 transitions. [2020-02-10 20:12:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:25,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,072 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash -368774737, now seen corresponding path program 98 times [2020-02-10 20:12:25,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317896614] [2020-02-10 20:12:25,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317896614] [2020-02-10 20:12:25,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:25,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132320444] [2020-02-10 20:12:25,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:25,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:25,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:25,232 INFO L87 Difference]: Start difference. First operand 75 states and 164 transitions. Second operand 7 states. [2020-02-10 20:12:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,283 INFO L93 Difference]: Finished difference Result 109 states and 205 transitions. [2020-02-10 20:12:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:25,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,285 INFO L225 Difference]: With dead ends: 109 [2020-02-10 20:12:25,285 INFO L226 Difference]: Without dead ends: 93 [2020-02-10 20:12:25,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-02-10 20:12:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2020-02-10 20:12:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 20:12:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 151 transitions. [2020-02-10 20:12:25,287 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 151 transitions. Word has length 16 [2020-02-10 20:12:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,287 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 151 transitions. [2020-02-10 20:12:25,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 151 transitions. [2020-02-10 20:12:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:25,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,288 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1651313597, now seen corresponding path program 99 times [2020-02-10 20:12:25,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15262906] [2020-02-10 20:12:25,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15262906] [2020-02-10 20:12:25,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:25,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780856373] [2020-02-10 20:12:25,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:25,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:25,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:25,433 INFO L87 Difference]: Start difference. First operand 69 states and 151 transitions. Second operand 7 states. [2020-02-10 20:12:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,473 INFO L93 Difference]: Finished difference Result 106 states and 198 transitions. [2020-02-10 20:12:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:25,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,475 INFO L225 Difference]: With dead ends: 106 [2020-02-10 20:12:25,475 INFO L226 Difference]: Without dead ends: 94 [2020-02-10 20:12:25,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-02-10 20:12:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2020-02-10 20:12:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-02-10 20:12:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 155 transitions. [2020-02-10 20:12:25,479 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 155 transitions. Word has length 16 [2020-02-10 20:12:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,479 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 155 transitions. [2020-02-10 20:12:25,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 155 transitions. [2020-02-10 20:12:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:25,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,480 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1468150063, now seen corresponding path program 100 times [2020-02-10 20:12:25,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022719464] [2020-02-10 20:12:25,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022719464] [2020-02-10 20:12:25,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:25,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233177527] [2020-02-10 20:12:25,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:25,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:25,614 INFO L87 Difference]: Start difference. First operand 72 states and 155 transitions. Second operand 7 states. [2020-02-10 20:12:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,676 INFO L93 Difference]: Finished difference Result 102 states and 188 transitions. [2020-02-10 20:12:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:25,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,678 INFO L225 Difference]: With dead ends: 102 [2020-02-10 20:12:25,678 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:12:25,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:12:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2020-02-10 20:12:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-02-10 20:12:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 148 transitions. [2020-02-10 20:12:25,680 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 148 transitions. Word has length 16 [2020-02-10 20:12:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,681 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 148 transitions. [2020-02-10 20:12:25,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 148 transitions. [2020-02-10 20:12:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:25,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,682 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1834593451, now seen corresponding path program 101 times [2020-02-10 20:12:25,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725316151] [2020-02-10 20:12:25,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725316151] [2020-02-10 20:12:25,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:25,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897749596] [2020-02-10 20:12:25,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:25,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:25,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:25,809 INFO L87 Difference]: Start difference. First operand 69 states and 148 transitions. Second operand 7 states. [2020-02-10 20:12:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,858 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2020-02-10 20:12:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:25,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,859 INFO L225 Difference]: With dead ends: 101 [2020-02-10 20:12:25,859 INFO L226 Difference]: Without dead ends: 91 [2020-02-10 20:12:25,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-02-10 20:12:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2020-02-10 20:12:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:12:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 151 transitions. [2020-02-10 20:12:25,862 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 151 transitions. Word has length 16 [2020-02-10 20:12:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,862 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 151 transitions. [2020-02-10 20:12:25,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 151 transitions. [2020-02-10 20:12:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:25,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:25,867 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1116203925, now seen corresponding path program 102 times [2020-02-10 20:12:25,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629633564] [2020-02-10 20:12:25,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629633564] [2020-02-10 20:12:25,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:25,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688388664] [2020-02-10 20:12:25,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:25,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:25,983 INFO L87 Difference]: Start difference. First operand 71 states and 151 transitions. Second operand 7 states. [2020-02-10 20:12:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,036 INFO L93 Difference]: Finished difference Result 99 states and 181 transitions. [2020-02-10 20:12:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:26,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,037 INFO L225 Difference]: With dead ends: 99 [2020-02-10 20:12:26,037 INFO L226 Difference]: Without dead ends: 85 [2020-02-10 20:12:26,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-02-10 20:12:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2020-02-10 20:12:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-02-10 20:12:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 139 transitions. [2020-02-10 20:12:26,040 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 139 transitions. Word has length 16 [2020-02-10 20:12:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,040 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 139 transitions. [2020-02-10 20:12:26,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 139 transitions. [2020-02-10 20:12:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:26,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,041 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,041 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1956127215, now seen corresponding path program 103 times [2020-02-10 20:12:26,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400343673] [2020-02-10 20:12:26,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400343673] [2020-02-10 20:12:26,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:26,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321739903] [2020-02-10 20:12:26,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:26,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:26,179 INFO L87 Difference]: Start difference. First operand 65 states and 139 transitions. Second operand 7 states. [2020-02-10 20:12:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,211 INFO L93 Difference]: Finished difference Result 101 states and 183 transitions. [2020-02-10 20:12:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:26,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,212 INFO L225 Difference]: With dead ends: 101 [2020-02-10 20:12:26,212 INFO L226 Difference]: Without dead ends: 89 [2020-02-10 20:12:26,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-02-10 20:12:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2020-02-10 20:12:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-02-10 20:12:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 134 transitions. [2020-02-10 20:12:26,217 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 134 transitions. Word has length 16 [2020-02-10 20:12:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,218 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 134 transitions. [2020-02-10 20:12:26,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 134 transitions. [2020-02-10 20:12:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:26,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,224 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1953993795, now seen corresponding path program 104 times [2020-02-10 20:12:26,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338503719] [2020-02-10 20:12:26,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338503719] [2020-02-10 20:12:26,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:26,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83574617] [2020-02-10 20:12:26,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:26,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:26,376 INFO L87 Difference]: Start difference. First operand 65 states and 134 transitions. Second operand 7 states. [2020-02-10 20:12:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,430 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2020-02-10 20:12:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:26,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,431 INFO L225 Difference]: With dead ends: 99 [2020-02-10 20:12:26,432 INFO L226 Difference]: Without dead ends: 83 [2020-02-10 20:12:26,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-02-10 20:12:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2020-02-10 20:12:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-02-10 20:12:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 120 transitions. [2020-02-10 20:12:26,434 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 120 transitions. Word has length 16 [2020-02-10 20:12:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,434 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 120 transitions. [2020-02-10 20:12:26,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 120 transitions. [2020-02-10 20:12:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:26,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,435 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1434938509, now seen corresponding path program 105 times [2020-02-10 20:12:26,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113848975] [2020-02-10 20:12:26,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113848975] [2020-02-10 20:12:26,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:26,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058758297] [2020-02-10 20:12:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:26,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:26,588 INFO L87 Difference]: Start difference. First operand 59 states and 120 transitions. Second operand 7 states. [2020-02-10 20:12:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,625 INFO L93 Difference]: Finished difference Result 92 states and 162 transitions. [2020-02-10 20:12:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:26,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,627 INFO L225 Difference]: With dead ends: 92 [2020-02-10 20:12:26,627 INFO L226 Difference]: Without dead ends: 80 [2020-02-10 20:12:26,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-02-10 20:12:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2020-02-10 20:12:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-02-10 20:12:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 126 transitions. [2020-02-10 20:12:26,629 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 126 transitions. Word has length 16 [2020-02-10 20:12:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,630 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 126 transitions. [2020-02-10 20:12:26,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 126 transitions. [2020-02-10 20:12:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:26,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,630 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,630 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1473916669, now seen corresponding path program 106 times [2020-02-10 20:12:26,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390061900] [2020-02-10 20:12:26,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390061900] [2020-02-10 20:12:26,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:26,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252853955] [2020-02-10 20:12:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:26,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:26,776 INFO L87 Difference]: Start difference. First operand 63 states and 126 transitions. Second operand 7 states. [2020-02-10 20:12:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,833 INFO L93 Difference]: Finished difference Result 82 states and 147 transitions. [2020-02-10 20:12:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:26,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,835 INFO L225 Difference]: With dead ends: 82 [2020-02-10 20:12:26,835 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:12:26,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:12:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-02-10 20:12:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-02-10 20:12:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 116 transitions. [2020-02-10 20:12:26,837 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 116 transitions. Word has length 16 [2020-02-10 20:12:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,837 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 116 transitions. [2020-02-10 20:12:26,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 116 transitions. [2020-02-10 20:12:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:26,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:26,838 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash 340355231, now seen corresponding path program 107 times [2020-02-10 20:12:26,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001788810] [2020-02-10 20:12:26,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001788810] [2020-02-10 20:12:26,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303380653] [2020-02-10 20:12:26,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:26,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:26,992 INFO L87 Difference]: Start difference. First operand 59 states and 116 transitions. Second operand 7 states. [2020-02-10 20:12:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,048 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2020-02-10 20:12:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:27,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,049 INFO L225 Difference]: With dead ends: 89 [2020-02-10 20:12:27,049 INFO L226 Difference]: Without dead ends: 79 [2020-02-10 20:12:27,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-02-10 20:12:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2020-02-10 20:12:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-02-10 20:12:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 121 transitions. [2020-02-10 20:12:27,052 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 121 transitions. Word has length 16 [2020-02-10 20:12:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,052 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 121 transitions. [2020-02-10 20:12:27,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 121 transitions. [2020-02-10 20:12:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:27,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,053 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,053 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash 243832391, now seen corresponding path program 108 times [2020-02-10 20:12:27,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580149827] [2020-02-10 20:12:27,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580149827] [2020-02-10 20:12:27,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:27,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171687622] [2020-02-10 20:12:27,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:27,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:27,200 INFO L87 Difference]: Start difference. First operand 62 states and 121 transitions. Second operand 7 states. [2020-02-10 20:12:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,257 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2020-02-10 20:12:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:27,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,258 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:12:27,258 INFO L226 Difference]: Without dead ends: 63 [2020-02-10 20:12:27,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-02-10 20:12:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2020-02-10 20:12:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-02-10 20:12:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2020-02-10 20:12:27,261 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 103 transitions. Word has length 16 [2020-02-10 20:12:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,261 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 103 transitions. [2020-02-10 20:12:27,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 103 transitions. [2020-02-10 20:12:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:27,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,262 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1803137139, now seen corresponding path program 109 times [2020-02-10 20:12:27,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157625313] [2020-02-10 20:12:27,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157625313] [2020-02-10 20:12:27,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968647429] [2020-02-10 20:12:27,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:27,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:27,419 INFO L87 Difference]: Start difference. First operand 53 states and 103 transitions. Second operand 7 states. [2020-02-10 20:12:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,456 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2020-02-10 20:12:27,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:27,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,457 INFO L225 Difference]: With dead ends: 81 [2020-02-10 20:12:27,457 INFO L226 Difference]: Without dead ends: 69 [2020-02-10 20:12:27,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-02-10 20:12:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2020-02-10 20:12:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-02-10 20:12:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 100 transitions. [2020-02-10 20:12:27,460 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 100 transitions. Word has length 16 [2020-02-10 20:12:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,460 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 100 transitions. [2020-02-10 20:12:27,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 100 transitions. [2020-02-10 20:12:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:27,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,461 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash 627633503, now seen corresponding path program 110 times [2020-02-10 20:12:27,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200040120] [2020-02-10 20:12:27,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200040120] [2020-02-10 20:12:27,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:27,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623436993] [2020-02-10 20:12:27,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:27,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:27,616 INFO L87 Difference]: Start difference. First operand 53 states and 100 transitions. Second operand 7 states. [2020-02-10 20:12:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,672 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2020-02-10 20:12:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:27,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,673 INFO L225 Difference]: With dead ends: 77 [2020-02-10 20:12:27,673 INFO L226 Difference]: Without dead ends: 66 [2020-02-10 20:12:27,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-02-10 20:12:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2020-02-10 20:12:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:12:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2020-02-10 20:12:27,675 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 16 [2020-02-10 20:12:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,676 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2020-02-10 20:12:27,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2020-02-10 20:12:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:27,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,677 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1821571165, now seen corresponding path program 111 times [2020-02-10 20:12:27,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215498320] [2020-02-10 20:12:27,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215498320] [2020-02-10 20:12:27,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:27,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250316012] [2020-02-10 20:12:27,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:27,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:27,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:27,828 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 7 states. [2020-02-10 20:12:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,866 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2020-02-10 20:12:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:27,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,867 INFO L225 Difference]: With dead ends: 73 [2020-02-10 20:12:27,867 INFO L226 Difference]: Without dead ends: 61 [2020-02-10 20:12:27,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-02-10 20:12:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2020-02-10 20:12:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-02-10 20:12:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2020-02-10 20:12:27,869 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 16 [2020-02-10 20:12:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,869 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2020-02-10 20:12:27,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2020-02-10 20:12:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:27,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:27,870 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash 926097059, now seen corresponding path program 112 times [2020-02-10 20:12:27,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490682408] [2020-02-10 20:12:27,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,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 20:12:28,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490682408] [2020-02-10 20:12:28,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:28,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283573793] [2020-02-10 20:12:28,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:28,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:28,031 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand 7 states. [2020-02-10 20:12:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,082 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2020-02-10 20:12:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:28,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,083 INFO L225 Difference]: With dead ends: 63 [2020-02-10 20:12:28,083 INFO L226 Difference]: Without dead ends: 50 [2020-02-10 20:12:28,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-02-10 20:12:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2020-02-10 20:12:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-02-10 20:12:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 70 transitions. [2020-02-10 20:12:28,085 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 70 transitions. Word has length 16 [2020-02-10 20:12:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,085 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 70 transitions. [2020-02-10 20:12:28,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 70 transitions. [2020-02-10 20:12:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:28,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,086 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1082979805, now seen corresponding path program 113 times [2020-02-10 20:12:28,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699430280] [2020-02-10 20:12:28,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699430280] [2020-02-10 20:12:28,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:28,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990328913] [2020-02-10 20:12:28,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:28,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:28,242 INFO L87 Difference]: Start difference. First operand 40 states and 70 transitions. Second operand 7 states. [2020-02-10 20:12:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,292 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2020-02-10 20:12:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:28,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,293 INFO L225 Difference]: With dead ends: 60 [2020-02-10 20:12:28,293 INFO L226 Difference]: Without dead ends: 52 [2020-02-10 20:12:28,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-02-10 20:12:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2020-02-10 20:12:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-02-10 20:12:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-02-10 20:12:28,295 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 16 [2020-02-10 20:12:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,295 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-02-10 20:12:28,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-02-10 20:12:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:28,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,296 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1082385159, now seen corresponding path program 114 times [2020-02-10 20:12:28,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571446732] [2020-02-10 20:12:28,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571446732] [2020-02-10 20:12:28,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:28,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011702072] [2020-02-10 20:12:28,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:28,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:28,436 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 7 states. [2020-02-10 20:12:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,488 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2020-02-10 20:12:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:28,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,489 INFO L225 Difference]: With dead ends: 51 [2020-02-10 20:12:28,489 INFO L226 Difference]: Without dead ends: 37 [2020-02-10 20:12:28,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-02-10 20:12:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-02-10 20:12:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 20:12:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2020-02-10 20:12:28,491 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 16 [2020-02-10 20:12:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,492 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2020-02-10 20:12:28,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2020-02-10 20:12:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:28,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,493 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1811485409, now seen corresponding path program 115 times [2020-02-10 20:12:28,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219048185] [2020-02-10 20:12:28,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:28,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219048185] [2020-02-10 20:12:28,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:28,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402675761] [2020-02-10 20:12:28,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:28,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:28,621 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 7 states. [2020-02-10 20:12:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,669 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2020-02-10 20:12:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:28,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,670 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:12:28,670 INFO L226 Difference]: Without dead ends: 44 [2020-02-10 20:12:28,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-02-10 20:12:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2020-02-10 20:12:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-02-10 20:12:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-02-10 20:12:28,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 16 [2020-02-10 20:12:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,672 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-02-10 20:12:28,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-02-10 20:12:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:28,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,673 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash -467315489, now seen corresponding path program 116 times [2020-02-10 20:12:28,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062780742] [2020-02-10 20:12:28,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062780742] [2020-02-10 20:12:28,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:28,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40187387] [2020-02-10 20:12:28,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:28,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:28,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:28,813 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 7 states. [2020-02-10 20:12:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,863 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2020-02-10 20:12:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:28,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,864 INFO L225 Difference]: With dead ends: 52 [2020-02-10 20:12:28,864 INFO L226 Difference]: Without dead ends: 42 [2020-02-10 20:12:28,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-02-10 20:12:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-02-10 20:12:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 20:12:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-02-10 20:12:28,866 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 16 [2020-02-10 20:12:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,867 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-02-10 20:12:28,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-02-10 20:12:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:28,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:28,867 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1793051383, now seen corresponding path program 117 times [2020-02-10 20:12:28,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337675835] [2020-02-10 20:12:28,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,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 20:12:29,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337675835] [2020-02-10 20:12:29,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:29,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078732554] [2020-02-10 20:12:29,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:29,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:29,001 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 7 states. [2020-02-10 20:12:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,055 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2020-02-10 20:12:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:29,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,056 INFO L225 Difference]: With dead ends: 48 [2020-02-10 20:12:29,056 INFO L226 Difference]: Without dead ends: 38 [2020-02-10 20:12:29,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-02-10 20:12:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-02-10 20:12:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 20:12:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-02-10 20:12:29,057 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 16 [2020-02-10 20:12:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,058 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-02-10 20:12:29,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-02-10 20:12:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:29,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,058 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1548897127, now seen corresponding path program 118 times [2020-02-10 20:12:29,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254577745] [2020-02-10 20:12:29,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254577745] [2020-02-10 20:12:29,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:29,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999981945] [2020-02-10 20:12:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:29,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:29,215 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 7 states. [2020-02-10 20:12:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,262 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-02-10 20:12:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:29,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,263 INFO L225 Difference]: With dead ends: 40 [2020-02-10 20:12:29,263 INFO L226 Difference]: Without dead ends: 28 [2020-02-10 20:12:29,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-02-10 20:12:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-02-10 20:12:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-02-10 20:12:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-02-10 20:12:29,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2020-02-10 20:12:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,265 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-02-10 20:12:29,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-02-10 20:12:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:29,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,266 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 406425191, now seen corresponding path program 119 times [2020-02-10 20:12:29,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989846250] [2020-02-10 20:12:29,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989846250] [2020-02-10 20:12:29,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:29,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88893907] [2020-02-10 20:12:29,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:29,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:29,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:29,424 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 7 states. [2020-02-10 20:12:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,472 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-02-10 20:12:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:29,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,473 INFO L225 Difference]: With dead ends: 34 [2020-02-10 20:12:29,473 INFO L226 Difference]: Without dead ends: 26 [2020-02-10 20:12:29,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-02-10 20:12:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-02-10 20:12:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-02-10 20:12:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-02-10 20:12:29,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2020-02-10 20:12:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,475 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-02-10 20:12:29,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-02-10 20:12:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-02-10 20:12:29,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:29,476 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash 407019837, now seen corresponding path program 120 times [2020-02-10 20:12:29,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41987476] [2020-02-10 20:12:29,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41987476] [2020-02-10 20:12:29,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-02-10 20:12:29,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489132109] [2020-02-10 20:12:29,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-02-10 20:12:29,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-02-10 20:12:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:12:29,616 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2020-02-10 20:12:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,661 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-02-10 20:12:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-02-10 20:12:29,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-02-10 20:12:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,662 INFO L225 Difference]: With dead ends: 25 [2020-02-10 20:12:29,662 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 20:12:29,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-02-10 20:12:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 20:12:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 20:12:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 20:12:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 20:12:29,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-02-10 20:12:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,663 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 20:12:29,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-02-10 20:12:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 20:12:29,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 20:12:29,667 INFO L202 PluginConnector]: Adding new model example_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:12:29 BasicIcfg [2020-02-10 20:12:29,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:12:29,669 INFO L168 Benchmark]: Toolchain (without parser) took 28656.16 ms. Allocated memory was 138.4 MB in the beginning and 433.6 MB in the end (delta: 295.2 MB). Free memory was 120.3 MB in the beginning and 111.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 304.2 MB. Max. memory is 7.1 GB. [2020-02-10 20:12:29,669 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:12:29,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.76 ms. Allocated memory is still 138.4 MB. Free memory was 120.1 MB in the beginning and 118.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 20:12:29,670 INFO L168 Benchmark]: Boogie Preprocessor took 18.45 ms. Allocated memory is still 138.4 MB. Free memory was 118.3 MB in the beginning and 117.4 MB in the end (delta: 933.8 kB). Peak memory consumption was 933.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:12:29,670 INFO L168 Benchmark]: RCFGBuilder took 247.10 ms. Allocated memory is still 138.4 MB. Free memory was 117.2 MB in the beginning and 105.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-02-10 20:12:29,671 INFO L168 Benchmark]: TraceAbstraction took 28350.13 ms. Allocated memory was 138.4 MB in the beginning and 433.6 MB in the end (delta: 295.2 MB). Free memory was 105.3 MB in the beginning and 111.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 289.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:12:29,673 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.76 ms. Allocated memory is still 138.4 MB. Free memory was 120.1 MB in the beginning and 118.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.45 ms. Allocated memory is still 138.4 MB. Free memory was 118.3 MB in the beginning and 117.4 MB in the end (delta: 933.8 kB). Peak memory consumption was 933.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 247.10 ms. Allocated memory is still 138.4 MB. Free memory was 117.2 MB in the beginning and 105.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28350.13 ms. Allocated memory was 138.4 MB in the beginning and 433.6 MB in the end (delta: 295.2 MB). Free memory was 105.3 MB in the beginning and 111.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 289.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.2s, 44 ProgramPointsBefore, 38 ProgramPointsAfterwards, 48 TransitionsBefore, 42 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 120 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 130 CheckedPairsTotal, 6 TotalNumberOfCompositions - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 28.0s, OverallIterations: 124, TraceHistogramMax: 1, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 4412 SDtfs, 6995 SDslu, 6966 SDs, 0 SdLazy, 2498 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred 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: 0.5s AutomataMinimizationTime, 124 MinimizatonAttempts, 3834 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1984 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1860 ConstructedInterpolants, 0 QuantifiedInterpolants, 417870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 124 InterpolantComputations, 124 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 proved your program to be correct! Received shutdown request...